Author: Martin Giepmans
Date: 09:07:35 12/27/01
Go up one level in this thread
On December 27, 2001 at 08:43:35, Uri Blass wrote: >On December 27, 2001 at 08:15:08, K. Burcham wrote: > >> >>I guess that you missed the following post about spidderchess that needed less >>than 1 second >> >>http://www.icdchess.com/forums/1/message.shtml?203638 >> >>Uri >> >> >>Uri, did you believe this? > >Yes > >>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 you know it >I do not know it and I believe the programmer. > >I believe that it is not impossible to do it and >the fact that other programs are not close to do it >means nothing. > >It is possible that spidderchess use different search rules >than other programs. > >I also plan to use different search rules >that are going to help my program to solve it faster but >I need to compare them with the known search rules >also in other positions before deciding if >it is a good idea to use them. > > >Uri It's indeed true that SpiderChess uses different searchrules. I try to simulate the human chessplayer. I try ... And in this position it works! Now all those other positions :) Martin
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.