Author: Kevin K
Date: 08:16:55 08/04/05
Hello, Dr. Hyatt.
My question is about easy move in root.c:
if (sort_value[0] > sort_value[1] + 200 &&
((To(rmoves[0]) == To(last_opponent_move) &&
Captured(rmoves[0]) == Piece(last_opponent_move)) ||
sort_value[0] < PAWN_VALUE)) <------ ?
easy_move = 1;
I understand recapture is easy move.
But, I don't understand why if sort_value[0] < PAWN_VALUE, it is easy move.
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.