Author: Angrim
Date: 00:49:02 08/11/00
Go up one level in this thread
On August 10, 2000 at 16:17:47, Christoph Fieberg wrote: >Unbelievable, but true: >I composed a position which is mate in 1 and can easily found, but Fritz6 on >Pentium III, 500 Mhz and 32 MB Hash needs more than 1 hour to show it (excatly >1:03:17)!!! >How do other computers react? > interesting position. Clearly the problem is that it is sorting capture moves first, and doing a complete qsearch of each move. Using my very new chess player, I got rather mixed results on this. I set my program to infinite search mode, entered this position, and told it to go. It instantly output the win in the debug file, and then hung. from my debug file: PN win found, 45 evals 1 expands proved that move a1h1 wins, 0 turns PN-search:45 evals, 1 expands, 1 max ply, 0.00 seconds However, since it was not out of time it then wanted to finish searching (with qsearch) at least the first ply, and my qsearch has at least as much trouble with this position as anyone else's does. I hope not to see this position in a real game :) Angrim
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.