Let's have a look on an attacking piece, for instance the Bishop
A Bishop can reach every square on the board within two moves.
The question is, what potential targets are there within this reach?
Every hostile piece on the same color can be a possible target.
The next question is, what are the impediments between the Bishop and its target? And can those impediments be removed?
To see that quick you can imagine some sort of rake that comes out of the Bishop.
In fact this is an extended version of the X-ray scan from Mousetrapper.
Every Bishop has two outgoing rakes with a right angle in between (see both diagrams)
White to move and win.
I am experimenting with "X-rake jogging".
That goes as follows.
I adjust the thinkinglevel of Arena to 40 seconds per ply and let the computer play against itself.
If white is to move:
I imagine rake 1 for the white-squared Bishop of white and have a look at the targets within its reach.
I imagine rake 2 for the same Bishop.
Then I do the same for the black-squared Bishop of white.
When black is to move, I do the same for blacks Bishops.
At the moment I stil have to follow all the single paths from Bishop to target, which takes a lot of time.
Of course the final goal is that a whole rake pops out immediate when looking at a bishop.
At the same way you can look at the rooks, which is simpler. See a previous post of mine for an explanation of this phenomenon.
Momentum in Chess: How Emotions Can Win Games
23 hours ago