Author: Dave Gomboc
Date: 16:57:30 10/13/99
Go up one level in this thread
On October 13, 1999 at 16:45:14, Jeremiah Penery wrote: >On October 13, 1999 at 14:30:30, Ratko V Tomic wrote: > ><snip DBx100> > >>In checkers, for example, Tinsley vs program Chinook, won the match by seeing >>plans 35-40 plies long, which were far beyond Chinook (which could see around 20 >>plies ahead). Speeding up Chinook 100 or 1000 times wouldn't have made much >>difference, since Chinook still couldn't see (not even remotely) what Tinsley >>could. > >Didn't something like 70% of Chinook's searching _from the first position_ end >in the TBs? In these cases, Chinook was seeing *everything*. Of course, as the >game progressed, even more of its searches ended in the TBs. Even though >Chinook couldn't see as much as Tinsley in pure search, the TBs probably more >than made up for it in this case. > >Jeremiah Sometimes Chinook searches into the endgame tablebases from the end of its opening book. There are some opening lines that Chinook can prove are forced wins/losses. In the main, this isn't the case, though. Andreas (Junghanns, Ph.D.) is working towards strongly solving checkers in the time he has left at the U of A. Dave
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.