Author: Guillaume MOYA
Date: 09:55:59 02/22/05
Go up one level in this thread
On February 22, 2005 at 12:45:41, Tord Romstad wrote: My alpha beta function is called 2.034.953 times ... ugh I should have a big bug somewhere! I will look for it, thanks a lot. Cheers Guillaume >On February 22, 2005 at 12:01:24, Guillaume MOYA wrote: > >>(a) No, I've got a P4 2.6C, not the high end standard but it works. >>(b) Sorry, I should have write "history heuristic", I store in a 64x64 (from-to) >>table, the cut-off count, then I perform a quicksort on the move generated. > >Most of us don't do a sort. We just assign each move a score, and then loop >through the move list and select the highest rated move. If we finish this >move and there is no beta cutoff, we select the second highest rated move, >and so on. The point is that doing a complete sort is usually more work >than is necessary. > >>I changed my king check detection routine, and it takes 1703 ms to find the PV >>now, how many time it should take? > >Hardly any time at all. So little, in fact, that it is hard to measure >accurately. A better question is, how many nodes do you need to complete >a 4 ply search from this position? If you need more than 100,000 nodes, >you almost certainly have a buggy and/or very inefficient search (which is >nothing to be ashamed of, we have all been there). > >Tord
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.