Author: Gian-Carlo Pascutto
Date: 06:10:44 12/27/01
Go up one level in this thread
On December 27, 2001 at 08:15:08, K. Burcham wrote: >Uri, did you believe this? > >it has to be either for the wrong reason, or the program was run after >position learning. we know for the necessary calculations, this position >cannot be determined in one second. maybe his clock posts are incorrect. >i do not believe the spiderchess post. > >kburcham Spiderchess uses different search rules than regular programs. It does not nullmove for example. It's also seems to have a pretty mean endgame, from what I have seen. This position is quite sensitive to pruning and extensions. I can see Sjeng go nuts on it after playing out Qxh6. -- GCP
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.