Hi all programmers,
Michel, Gilbert, Taille without forget the others greater programmers, before any word, HAPPY NEW YEAR to all.
I will be happy to have the light on the tittle of my topic.
If an engine A to a same position reach 22th ply with 4M/s and another engine B reach the same depth with 8M/s. Which engine of the 2 it's more stronger.
Just to say that i don't know if it's the depth of plies reached or the nodes/s, so the speed used to reach this depht that determine the strenght of an engine.
Happy new year Sidiki and all programmers.
Of course speed allows to find the best move in less time but speed is just one minor point when judging the strength of a program.
In addition the number of position per second is the worse criteria to take into account for a simple reason: let's compare a GMI and a strong program : the GMI and the program may have the same strength but while the program sees 4M positions per second how many positions per second can see the GMI ? Obvioulsy the program compensates a poor evaluation (comparing to the GMI's one) by a huge search. For that reason I think a better evaluation, reached by reinforcement learning, will greatly diminish the number of positions per second but will lead to far better results.
The key point for a strong program is for me a good evaluation allowing to prune agressively early in the tree search. Isn't it the differrnece between a GMI and a weaker player ?
BTW I am not able to say what the number of plies means. If your program use a very agressive pruning that means that some variants may be analysed on let's say 40 plies will other will stop after 6 plies. What can you conclude ? If the evaluation is very good this agressive pruning could lead to a very strong program otherwise this program may be sometimes very strong but also very weak.
Taking into account the number of positions per second and/or the number of plies is a non sense I you do not know teh eval function and the search algorithm.