Author: Jeroen Noomen
Date: 07:04:28 01/11/03
Go up one level in this thread
On January 11, 2003 at 09:27:20, Rafael Andrist wrote: >Recongizing that the rooks cannot get on >the other side of the wall is a little bit harder and more time consuming, but >it is only neccessary to check that if the position is blocked anyway. Also >detecting other common and known endgame fortresses is fast when using >bitboards. What is 'blocked' in your opinion? How do you recognise that the rooks cannot get in? How to define that? And most important: Why bother with this position, which will never occur in a game? >Of course you can never catch all exceptions, but to detect the most important >ones only is not that time consuming. What are 'the most important ones'? Do you think this position above is an important exception? I don't think so. Besides, modern programs are programmed not to block the position in this way. So it is pretty useless IMO to solve it. It is much more important that a computer chess program knows how to handle blocked positions. Jeroen
This page took 0 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.