Corpus ID: 199395904

Trappy Minimax in chess , and the elusive meaning of “ best move ”

@inproceedings{Gordon2014TrappyMI,
  title={Trappy Minimax in chess , and the elusive meaning of “ best move ”},
  author={V. S. Gordon and M. Vollmer and Colin},
  year={2014}
}
  • V. S. Gordon, M. Vollmer, Colin
  • Published 2014
  • Trappy minimax is a modification to minimax that attempts to identify and set traps in two-player strategy games. It defines a trap as a move that looks good at a shallow search depth, but is revealed to be in fact a bad move, when analyzed at a greater search depth. The algorithm utilizes information accumulated during iterative deepening, and then rewards moves that lead to traps. The reward mechanism often causes the computer to select moves that normal minimax considers inferior, because… CONTINUE READING

    Figures from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES