Author: Gian-Carlo Pascutto
Date: 11:18:03 09/08/01
Go up one level in this thread
On September 08, 2001 at 13:53:03, K. Burcham wrote: >i assume deep blue had some type of memory storage for eval > of previous lines searched. if it did are you saying that > deep blue cleared its memory (hash), with each move? > >if it did not clear its memory with each move then your seven > second search limit does not make sense to me. > >and can you tell me which game this move was taken from, so that i > can get a better analysis of this position. i can find it, but you > can save me a lot of time, if you will. > >i will post my results after the analysis of this position. > >kburcham As Vincent has already explained, they (probably) cleared hash. DT played this move in a game on tournament time controls, so that means probably in less than 3 minutes (it's an estimate) AND it knew it was winning a piece when it played the move. DB was over 28 times faster than DT2, so I arrive at 6.something seconds. These are estimates. I don't care if you solve it in 14 seconds or 4. But it gives you an idea of what order or magnitude the solution time should have. Crafty finds the move quickly but has no clue it's winning a piece (draw score), not even after 4 hours on an Athlon 1000. The game is from the ACM Championships, Cray Blitz vs Deep Thought II Cray Blitz lost. -- 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.