To Gerd (attacks fills, safe squares, future mobility, etc.)

[Karlo Bala]

I'm searching for a post from Gerd, probably more than 15 years old. I think it is posted on the CCC, but maybe on the Winboard forum or even on the Talkchess. I think I read all Gerds posts, but I can't find it. A few lines of code could be recreated easily, but I remember it was simply an inspiring post. I'm pretty sure I read it, but who knows maybe my memory is falling apart, and that drives me crazy.

Any help would be appreciated.

[phhnguyen]

Perhaps this one:

https://www.chessprogramming.org/Effici ... ce_Attacks

[Gerd Isenberg]

I'm searching for a post from Gerd, probably more than 15 years old. I think it is posted on the CCC, but maybe on the Winboard forum or even on the Talkchess. I think I read all Gerds posts, but I can't find it. A few lines of code could be recreated easily, but I remember it was simply an inspiring post. I'm pretty sure I read it, but who knows maybe my memory is falling apart, and that drives me crazy.

Any help would be appreciated.

Hi Karlo,
I can't remember exactly, there seems no cpw link to this posting of mine. It may be in the context of future mobility, i.e. feeding in all squares controlled by a bishop, not controlled by opponent's pawn - to a diagonal/antidiagonal fill algorithm for a set of squares reachable in two bishop moves.

Gerd

[Karlo Bala]

I'm searching for a post from Gerd, probably more than 15 years old. I think it is posted on the CCC, but maybe on the Winboard forum or even on the Talkchess. I think I read all Gerds posts, but I can't find it. A few lines of code could be recreated easily, but I remember it was simply an inspiring post. I'm pretty sure I read it, but who knows maybe my memory is falling apart, and that drives me crazy.

Any help would be appreciated.

Hi Karlo,
I can't remember exactly, there seems no cpw link to this posting of mine. It may be in the context of future mobility, i.e. feeding in all squares controlled by a bishop, not controlled by opponent's pawn - to a diagonal/antidiagonal fill algorithm for a set of squares reachable in two bishop moves.

Gerd

Thanks, Gerd.
It seems the CCC search doesn't work as expected. Nevertheless, I read every post back to 2002, and found something Perhaps it could be interesting for newbies.

https://www.stmintz.com/ccc/index.php?id=275703