Click to See Complete Forum and Search --> : Help with MDT(f)


DeepButi
September 13th, 2004, 05:05 PM
I'm on the preliminary stages of a MDT(f) minimax alpha-beta algorithm.

It works perfectly well ... but (there's always a "but"!) ... although it finds the correct value I'm not able to find the correct moves associated.

The problem is not on the minimax (I can get the value AND the solution) but on the way I handle the Transposition Tables.

I mean, minimax without TT finds both, but minimax with TT is making me nervous :cry:.

I have not been able to find any example of handling the solution on Internet, all examples are about minimax "without memory" or on handling alpha-beta values, but nothing about the way to staore/retrieve moves.

Anyone knows a good link about it or has any experience with TT?

Thanks in advance

DeepButi
September 14th, 2004, 07:56 AM
Forget it. Searching with a zero-window will never allow PV (Principal variation), so the path can not be stored. Only best move can be of some help.

Thanks

Joe Nellis
September 15th, 2004, 02:49 AM
I agree fully.