Author: Heiner Marxen
Date: 12:21:34 02/09/00
Go up one level in this thread
On February 09, 2000 at 14:03:15, leonid wrote: >On February 09, 2000 at 13:39:38, José de Jesús García Ruvalcaba wrote: > >>On February 09, 2000 at 08:44:53, leonid wrote: >> >>>On February 08, 2000 at 20:11:50, Dann Corbit wrote: >>> >>>>2bnN1k1/6P1/4p3/1P2N1P1/3K4/8/8/8 w - - >>> >>>Move G5 - G6. Take 0.055 sec. >>> >>>AMD 400Mhz. Solved by Mate Solving Logic. >>> >>>Leonid. >> >>Hi Leonid! >> Have you compared the solving time of your Mate Solving Logic against solving >>times of Chest? >>Thanks in advance, >>José. Chest uses 0.15 seconds on a P/133. This is quite comparable to leonid´s time. >Hello, Jose! > >No. Will be interesting to try one day. This logic was created long time ago and >I practically never touched it after its creation. Expect come back one day and >speed it even more. Now I see that this is possible after the ideas that came to >me while writing my Positional Logic. For now, Mate Solving Logic, don't use any >hash tables, reference tables or any memory demanding technics. The hash table speeds up Chest for about 14% (conservative estimate). Within a mate in 4 there is not much chance for repeated positions. Heiner >When I tryed this logic for solving the mate some 4 years ago it was the >speediest against all other best games that I could find. Impecable as well. >Result was found after long statistics counted in thousands of positions. A comparison with Chest might be worthwhile, but I would use larger (deeper) jobs. The deeper, the more opportunities to do tricky speed ups. We may both learn from the other program, where it is significantly faster. >Hasta la vista! >Leonid. Have a nice day! Heiner
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.