Author: Andreas Herrmann
Date: 06:51:46 07/17/03
Go up one level in this thread
On July 17, 2003 at 02:26:19, Albert Bertilsson wrote: >A great way to find buggs in move generation is this: >1. Have a command that instead of calculating perft calculates the perft values >for all the children, and prints the list like this: >b1c3 9755 >b1a3 8885 >g1h3 8881 >g1f3 9748 >a2a3 8457 >... >2. Have a correct version of your program or another program that can do this >too. >3. When there is a difference at any perft value you see exactly which move that >leads you closer to the bug, do the move and calculate the perft values with >depth - 1, very soon you'll be at level 1 and when you compare the list of >children you'll see which move is missing, or illegal. > >If you need an engine to compare with you can use Sharper, I call the command >"divide". > >http://www.albert.nu/programs/sharper > >/Regards Albert Hi Albert, you can get the same results, if you do one possible move from starting position and then start perft n-1. Just do this for every legal move from the starting pos. and you have the same results. So you can compare it with each program, which has perft implemented. Andreas
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.