Author: Tony Werten
Date: 03:04:39 10/23/00
Go up one level in this thread
On October 21, 2000 at 17:55:22, Georg v. Zimmermann wrote: >On October 21, 2000 at 09:11:12, Pham Minh Tri wrote: > >>My questions are: >>- If I add more knowledge to the evaluation function, how does AlphaBeta >>function change (will the number of searched nodes increase, decrease or not >>change)? > >If you add more knowledge, your program will probably spend more time in the >eval() function. That way taking longer every time at the "leaf" of the search >tree the evaluation is called. Threfore you will serach less nodes. > >How much this will make your program slower depends on what time - percentage it >spends in which parts of the program before your change. If you have a very fast >evaluation and slow bitboard move generation adding to the eval() will not cost >you much. > > >>- If I do not sort or sort move list by other criteria, could score and move >>results be different? > >No, you should get exactly the same scores and moves after finishing a certain >depth. The last move of the PV could change though in certain cases if I am >making no thinking mistake. First, the move can change. If move A and B have the same score, the one that is searched first will be shown as best move. If the sort changes B to be searched first that will be the best move. Second ( more speculative ) The sort can change the number of extensions ( of they depend on the move ordering, like recapture ) and therefor might change score. I'm not realy sure but i think it could. cheers, Tony > >> >>Your answers will help my implementation much. Thanks in advance for any help. >> >>Pham > > >Have fun with your program ! > >Georg
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.