Author: Reinhard Scharnagl
Date: 07:29:21 12/04/05
Go up one level in this thread
On December 04, 2005 at 09:18:53, Brian Richardson wrote: >On December 03, 2005 at 22:21:20, Reinhard Scharnagl wrote: > >>On December 03, 2005 at 22:14:20, Brian Richardson wrote: >> >>>How similar are perft and alpha/beta trees? >>>Can perft caching can really be used to guide PVS or other actual search >>>caching? >> >>The test was targeting to find a relation between intended thinking time and >>cache size. Thus the absence of specialized search strategies has been intended. >> >>Reinhard. > >I thought perft just counts moves to a specified depth, so I'm not clear on what >"intended thinking time" means in this context. Of course, this could just be a >minor ENFLI English not first language issue :) >[As in someone who knows 2 languages is bilingual, and 3 is trilingual, but only >1 language is an American] > >Clearly, it is fair to say that caching does significantly impact perft time to >depth performance (although I suspect few engines use cache for perft). a) see: http://www.talkchess.com/forums/2/message.html?197740 b) how do you test, that your transposition table is working well and correct? My method is to compare Perft results to detect errors e.g. in generating of hash keys or in the replacement scheme's overall performance. Reinhard.
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.