Author: Bruce Moreland
Date: 09:32:16 02/16/99
Go up one level in this thread
On February 16, 1999 at 10:22:50, Steve Maughan wrote: >The position quoted is a famous one - it can be solved with the simple heuristic >of extending all move that give check with only one reply and extend all >position that only have one move. The reason the top programs do not get it is >that they have cut off the search at some high value to limit the tree in normal >position. This is certainly not a normal position! This is completely true. If I de-constrain my single-response extension, my program scores this as mate in 0.090 seconds. It would not normally return a mate score, although it would typically find the move that leads to mate. bruce
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.