Tool to minimax pgn games

[giovanni]

Keeping well in mind all the cavetas associated with this approach, is there a tool that would take as input a pgn file and output a minimaxed tree, say up to ply 20 and utilizing only positions appearing in at least, say, 3 times? Ideally, location of cut-nodes should be also somehow evidenced.

[Marek Soszynski]

You may appreciate...

Chess Openings Wizard http://www.bookup.com/home/
Aquarium http://chessok.com/?p=30091

[jefk]

what do you want to minimax ?
the engine score at the cutoff eg. ply 25, (or the game result ?).
As for using moves played at least two times, the old version
of bookbuilder (3.5) has this feature (compress book).
For the rest , BB35 can cutoff (when loading in pgn's)
at an arbitrary ply depth, eg. ply 30; after that you
can export the endnodes (EPD) and analyze them
with an engine. Load them into Bb35 again and subsequently
the fastest minimax of all apps is done by BB35.
(i tried Aquarium but couldn't get it to work, the minimax;
as for Bookup, it works, but it's slow (and no book compress).
www.superchess.blogspot.com
(the old BB35.zip is included in the download, which
you find after running the Bb43setup.exe)

[giovanni]

I would like to minimax the game score. I am not sure I understood if your program can do that. Also, which tool would your recommend for batch analysis of the epd file, before feeding it back to the program?

[glennsamuel32]

I'd strongly suggest Aquarium.
It comes with a learning curve, but you'll soon find out it's the most advanced bit of chess software you can find.
I'm not sure about "utilizing only positions appearing in at least, say, 3 times".
It'll convert the pgns into a tree and all positions will be analysed using user preferences of depth, time etc.
And it'll display the tree with iDea and Infinite analysis scores.

It also does batch analysis of user supplied epds.