Author: Uri Blass
Date: 00:19:07 08/31/03
Go up one level in this thread
On August 31, 2003 at 02:21:03, Steven Edwards wrote: >The portable C++ CT toolkit has classes for describing positions either with or >without bitboard representation in use. Here are the results of running both of >them for enumerating the 119,060,324 movepaths of length six from the initial >position on a 800 MHz G4 PPC notebook: > >Non bitboard: > >Frequency 1.07069 MHz >Period 933.98 ns >Cycles per node 747.184 > >Bitboard: > >Frequency 342.689 KHz >Period 2.9181 us >Cycles per node 2334.48 > >(There is no use of rotated bitboards, nor of any kind of machine or OS specific >techniques.) > >Since the bitboard mode is doing everything the non bitboard mode is doing, plus >more, we can see that the additional cost for bitboard manipulation is roughly >twice the cost of the shared portion of the work. > >Is it worth it? The answer depends on what is done with the additional >information provided by the bitboard database at each node. In CT, both modes >provide all of the following: > >1. A 64 entry array with the current board contents. > >2. The active color. > >3. The castling availability status. > >4. The en passant target square. > >5. The halfmove clock. > >6. The fullmove number (Items 1-6 together are the binary equivalent of FEN). > >7. The hash key for the main transposition table. > >8. The hash key for the pawn transposition table. > >9. The location squares of the kings. > >10. The material balance for both sides. > >11. A two way linked list of the moves leading to the position. > >12. A two way linked list of the main transposition table hash keys of the >previous positions. What do you mean by 11 and 12(can you give an example)? Uri
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.