Author: Olaf Jenkner
Date: 09:22:07 11/15/02
Go up one level in this thread
On November 15, 2002 at 03:54:37, Daniel Clausen wrote: >On November 14, 2002 at 16:42:50, Olaf Jenkner wrote: > >>On November 14, 2002 at 14:46:23, Dann Corbit wrote: >> >>>On November 14, 2002 at 14:34:04, Olaf Jenkner wrote: >>> >>>>It is mot a mate in 11. I did a 44 hour brute force search. >>> >>>What are your node counts by ply? >> >>Don't know, there where many overflows. A 32 bit number is >>too small. > >So why did you choose a 32bit number as a node counter? In my book you're being >grossly negligent. ;) > >Sargon The program does not have a node counter. It counts the number of calls of the mate function. Until 5 weeks I had a slow computer and a overflow did not often happen. The counter is not important for me. OJe
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.