Author: Anthony Cozzie
Date: 07:48:39 11/11/04
Go up one level in this thread
On November 11, 2004 at 09:30:05, Daniel Shawul wrote: >Today i finished organizing my BOARD class , and collecting some global >variables so that i can make a copy of a board easily. Problem is >I use 0x88 and piecelists which need huge for loops to copy. BITBOARDs look >easier. Is this too much of a problem? I am saying this because i think i have >to make a copy of the board each time a node is split. >daniel (from you-go-girl thread) 1. Nf3xe5[S] Qd8-e7 2. Bf5-e4[S] d6xe5[S] 3. Be4xb7[S] Nf4xe2 4. Ke1xe2[S] Qe7xb7[S] 5. Qc3xe5[S] f7-f6[S] 6. Qe5-e6 Rf8-f7 7. b4xc5 b6xc5 8. Bb2xf6 Nb8-c6 9. Qe6-d5 Ra8-e8 10. Ke2-f1[S] Nc6-d4 11. Qd5xb7 Rf7xb7 12. Bf6xd4 = (1.15) Depth: 14/43 00:08:30.99 609709kN (1193 KN/s, 4649 splits, 459 aborts) Note that the program split only 5000 times in 8 minutes. I am with Bob on this one; split overhead is important but not THAT important. anthony
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.