Home | Trees | Indices | Help |
---|
|
MTD(f)
from http://www.cs.vu.nl/~aske/mtdf.html
The name of the algorithm is short for MTD(n, f), which stands for something like Memory-enhanced Test Driver with node n and value f.
|
|||
TranspositionTableEntry | |||
TranspositionTable |
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
POSINFINITY = 99999
|
|||
NEGINFINITY = -99999
|
|||
AIPLAYER = 1
|
|||
transTable = <MeatEngine.AI.mtdf.TranspositionTable instance a
|
|
transTable
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0beta1 on Sat Jul 28 11:43:45 2007 | http://epydoc.sourceforge.net |