Author: Dann Corbit
Date: 00:16:42 10/15/98
Go up one level in this thread
On October 14, 1998 at 22:05:56, Robert Hyatt wrote: [snip] >the last time I tried this, on a P5/133, crafty at 1 minute per move could beat >a tablebase program from the worst case (mate in 34) within 50 moves. When I >tried it at real fast time controls, it could win, from this position, but not >within 50 moves. For more normal positions, which are mate-in-15 or so, it >could win those quite easily... It only needs enough search to see the mate >at the end, something like a mate in 4 or so, which takes a fraction of a >second. > >I have two "mate boards" and use the "right" one depending on the bishop I >have. I assume it still works, but will run the test in a few minutes on my >notebook to see... just like KQ vs KR tests... Important tablebase question: At extremely fast time controls (say, one to ten seconds per move) are tablebase lookups a waste of time? I really need to know the answer to this question. Even more pivotal is: "What is the break-even point" in time controls?
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.