Author: Tom Kerrigan
Date: 11:57:20 07/14/98
Go up one level in this thread
I'm glad my program was helpful. :) I think you're in pretty serious trouble if it's taking you 10 seconds to finish a 4 ply search on a fast computer. Using null move and rewriting your evaluation function in assembly language will help, but the point is that you shouldn't have to do this to get acceptable performance. How many nodes per second do you search? It sounds like you're allocating an array of structures every time you call search(). Does this involve calls to memalloc() or memcopy()? Memory management functions are usually very time-consuming. If you aren't searching very many nodes per second, you need to look for problems like this. The other question is how many nodes do you search to finish ply n. You shouldn't be searching very many more nodes than CPIP does. If this is a problem, maybe you can write a few functions to make sure your move generator is working correctly. It might also be helpful to use a debugger to make sure you're searching moves in the order you want. Cheers, Tom
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.