bruno/brchess
1
0
Fork 0
Code Issues 9 Projects Releases Wiki Activity

perft2: is_in_check() before recursion

Browse Source
This commit is contained in:
Bruno Raoult
2024-03-29 09:59:14 +01:00
parent 92d6909546
commit 24207583d1
1 changed files with 7 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
src/search.c
View File

@@ -100,8 +100,6 @@ u64 perft2(pos_t *pos, int depth, int ply)
move_t move; move_t move;
state_t state; state_t state;
if (is_in_check(pos, OPPONENT(pos->turn)))
return 0;
if (depth == 0) if (depth == 0)
return 1; return 1;
pos->checkers = pos_checkers(pos, pos->turn); pos->checkers = pos_checkers(pos, pos->turn);
@@ -113,13 +111,13 @@ u64 perft2(pos_t *pos, int depth, int ply)
for (nmove = 0; nmove < pseudo.nmoves; ++nmove ) { for (nmove = 0; nmove < pseudo.nmoves; ++nmove ) {
move = pseudo.move[nmove]; move = pseudo.move[nmove];
move_do(pos, move); move_do(pos, move);
if (!is_in_check(pos, OPPONENT(pos->turn))) {
subnodes = perft2(pos, depth - 1, ply + 1); subnodes = perft2(pos, depth - 1, ply + 1);
nodes += subnodes;
nodes += subnodes; if (ply == 1) {
if (ply == 1) { char movestr[8];
char movestr[8]; printf("%s: %d\n", move_str(movestr, move, 0), subnodes);
printf("%s: %d\n", move_str(movestr, move, 0), subnodes); }
} }
move_undo(pos, move); move_undo(pos, move);
pos->state = state; pos->state = state;