Author: Anthony Cozzie
Date: 10:21:33 03/23/04
Go up one level in this thread
After seeing Joachim's post that SMK solves this, I thought for about 5 seconds, and realized it isn't as hard as I thought. Step 1. Compute immovable pawnstructure. My guess is that he does this anyway. So here we recognize that that E3-F2-G3 is completely locked. This is not too hard to do, although I haven't worked out the mechanics completely. Step 2. Compute trappable squares. We simply floodfill from each square, and count the number of squares it can reach. This would be very slow, but we can speed it up as follows: We divide the board into 4 symmetric regions. (a piece will never get trapped on the center) Example: E1, F1, G1, H1, G2, H2, H3, H4 We then check for at least 1 immoveable pawn, before floodfilling in that region. Step 3. Store into the pawn hash. And now we have a very quick test to determine if a piece can be trapped. This will cull out 99.999% of references. anthony
This page took 0.01 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.