Author: Russell Reagan
Date: 17:28:45 01/09/02
Go up one level in this thread
>An engine with a perfect ordering will not play perfect chess. I will play >the best chess you could possibly play with the evaluation function of >that engine. > >Regards, >Miguel Maybe I am confusing what you mean by "perfect" move ordering. When I think of perfect move ordering I think that the moves are sorted in order from best to worst, i.e. that you know that the move at the top of the list is the best move (how one could possibly know this I have no idea). I think you are not meaning this. I think you are trying to ask how many nodes the program would look at if with it's given evaluation function it searched the first move and then the rest of the moves were all cutoff via alpha-beta pruning. Is that the point you are trying to get at? Russell
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.