Author: leonid
Date: 06:45:51 07/21/02
Go up one level in this thread
On July 21, 2002 at 09:25:43, leonid wrote: Sorry, Uri! Before by mistake this message came before it was done. >>>In my program moves generator look for entry squares (legal moves) only after >>>the list of pieces. Pieces list is dressed before asking moves generator to find >>>legal moves. Only moves for king is found the last one. King is put in the list >>>of pieces as last before moves generator. >> >>I do not understand exactly what you say but if the king is in check >>I have a different function and I do not look at every piece in my piece list to >>generate it's moves. Probably You generate moves for each piece and look immideately if those moves are enough to find best moves (value) for given ply. I do this only in two specialized ply. Before searching best move for given ply all moves for all pieces, for given color, are found. Only moves for king goes last in moves chain. King's move have less chance to be the best. Putting moves for king last in the list (or chain of moves) do not affect efficency of search in case when king's move is the best. Partially because in my move generator checking moves goes first and not checking later in the moves chain. After alignement of moves in generator all moves are once again aligned in order of putting the most promissing at the head of moves chain. This is done by taking in consideration best moves that were previously found for this ply. >>I used simple C. >>I have microsoft visual C++ I am used to Microsof Assembler also. I very liked its last editions, starting with 6.1. Leonid. >>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.