Author: Dieter Buerssner
Date: 15:47:08 07/20/01
Go up one level in this thread
On July 20, 2001 at 17:54:40, John Merlino wrote: >>> 8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w - - 0 1 >Here's Chessmaster 8000's results. It does NOT use hashtables.... > >Time Depth Score Positions Moves >0:00 24/25 1.72 53171 1. Kb1 Kb7 2. Kc1 Kc7 3. Kd1 Kd7 > 4. Kc2 Kc8 5. Kd2 Kd7 6. Kc3 Kc7 > 7. Kd3 Kb6 8. Ke3 Kc7 9. Kf3 Kd7 > 10. Ke2 Kd8 11. Kd3 Kc7 12. Kc3 > Kb7 13. Kc4 Kb6 >0:00 26/27 4.06 86924 1. Kb1 Kb7 2. Kc1 Kc7 3. Kd1 Kd7 > 4. Kc2 Kc8 5. Kd2 Kd7 6. Kc3 Kc7 > 7. Kd3 Kb6 8. Ke3 Kc7 9. Kf3 Kd7 > 10. Kg3 Ke7 11. Kh4 Kf6 12. Kh5 > Ke7 13. Kg5 Kf7 14. Kxf5 Ke7 Hmmm - you mean this serious? Without any hashtables at all? Reaching depth 24 or 25 or whatever this means in no time. This is really very impressive. Yace can find the move in about 30000 move with very small hash tables (say much less than 1 MB), but when I last tried, it did not find it within an hour without any hashtables (something like depth 20 or 22 was reached). 50000 nodes for depth 24 will mean an incredibly small branching factor. Regards, Dieter
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.