Tony's positional test suite

[Ferdy]

MEA - Multiple move EPD Analyzer beta interface can be found here.

https://mea.bitballoon.com/

[Dann Corbit]

MEA - Multiple move EPD Analyzer beta interface can be found here.

https://mea.bitballoon.com/

Thanks

[Rebel]

MEA - Multiple move EPD Analyzer beta interface can be found here.

https://mea.bitballoon.com/

Will try.

[first25plus5]

If anyone has the time to re-calibrate / re-test all sixteen positions with today's engines that would be appreciated.

[OldMan]

Beginner Question:
I assume you add the score of the position found for each position to get an engine rating.
At what time control.
I understand you searched for 24 hours to get the results, but for the test, any specific time controls.

I am returning to chess programming after a long absence.
My old program currently runs on a G4 Mac Laptop form 2004 while I work on re writing it.
I have forgotten a lot and am essentially starting over.

Wm.

[Dann Corbit]

The multi-answer type problems give a different score based upon the assumed correctness of the given move.
As programs get stronger and stronger, and hardware gets more and more powerful, the old answers (which would have been more or less correct at the time because of hardware and software limitations) improve and something that used to be a purely strategic concept like undermining, king safety, rooks on the 8th, because no material win was seen on the horizon become tactical because the engines can see deeply enough to find a tactical shot. It is also possible that other positional factors can become more important when combined with teh search.

A test set like Tony's positional suite has a number of different possible answers, each scoring differently depending upon what your engine chooses.

To update such a test suite, one might take several strong programs and run them on high end hardware for four hours per position with multi-pv set to 10 so that the engine is forced to think about many alternatives. Suppose that the best move as found by the engines has a score of 429. We divide this best score by 429 and multiply by ten giving a score of ten.
Suppose that for the next best solution we have a score of 313. We divide 313 by 429 and multiply by 10 giving a score of seven, and so on through all moves until the calculated score is less than one. Then on to the next problem.