Author: Uri Blass
Date: 12:23:45 08/23/03
I am afraid that I did not understand it. I remember claims that it is possible to do it fast. How is it possible? Suppose that you find that the white rook stops attacking a square. If you remember only that a white rook attacked the square without remembering more information then how do you know that there is not another rook that is attacking the same square? If you check that there is not another white rook that is attacking the same square before updating the attack array then it does not sound so cheap to do it. Uri
This page took 0.02 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.