Author: Severi Salminen
Date: 10:33:34 12/07/01
Go up one level in this thread
>both make unmake and gen are important Of course, but one should sacrifice the speed of make/unmake to make gen faster. >At this time make unmake are relatively slow and making a move takes clearly >more time then generating a move. When you have programmed searching functions also, you can test it more. The better the ordering, the faster the gen() should be (and usually this will bring the speed of make()/unmake() greatly down, and also the perft speed). Obviously if you have to make()/unmake() every move this kind of optimization will hurt. >I do not think that calculating perft emphasize making moves. It ephasizes if you do it like it is done in Crafty. But since you don't make/unmake() the last ply it emphasizes gen() more in your program. The problem with your approach is that it doesn't reflect anything about the speed of a normal search. In normal search if you visit N nodes you also have to make()/unmake() the last moves - perft() is like a full width search to a certain depth, we just don't evaluate anything. And you don't even reach those nodes, you just know how to get there. Yes, you will get the exact node count as Crafty but you can't compare the time. Severi
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.