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

    SHOWING 1-10 OF 16 REFERENCES
    Trappy Minimax - using Iterative Deepening to Identify and Set Traps in Two-Player Games
    • V. S. Gordon, A. Reda
    • Computer Science
    • 2006 IEEE Symposium on Computational Intelligence and Games
    • 2006
    • 8
    • PDF
    Problematic Positions and Speculative Play
    • 23
    Programming a computer for playing chess
    • 881
    • PDF
    The History Heuristic and Alpha-Beta Search Enhancements in Practice
    • J. Schaeffer
    • Computer Science
    • IEEE Trans. Pattern Anal. Mach. Intell.
    • 1989
    • 254
    • PDF
    ChessBrain II - A Hierarchical Infrastructure for Distributed Inhomogeneous Speed-Critical Computation
    • 6
    • PDF
    Heuristics - intelligent search strategies for computer problem solving
    • J. Pearl
    • Computer Science
    • Addison-Wesley series in artificial intelligence
    • 1984
    • 1,741
    2002
    • 1,951
    • PDF
    A
    • (1962). A Chess Playing Program for the IBM 7090 Computer, MIT bachelor’s thesis in Electrical Engineering, June
    • 1962