Corpus ID: 11263915

Combining Entropy Based Heuristics with Minimax Search and Temporal Differences to Play Hidden State Games

@inproceedings{Calbert2004CombiningEB,
  title={Combining Entropy Based Heuristics with Minimax Search and Temporal Differences to Play Hidden State Games},
  author={G. Calbert and Hing-Wah Kwok},
  year={2004}
}
  • G. Calbert, Hing-Wah Kwok
  • Published 2004
  • In this paper, we develop a method for playing variants of spatial games like chess or checkers, where the state of the opponent is only partially observable. Each side has a number of hidden pieces invisible to opposition. An estimate of the opponent state probability distribution is made assuming moves are made to maximize the entropy of subsequent state distribution or belief. The belief state of the game at any time is specified by a probability distribution over opponent’s states and… CONTINUE READING
    1 Citations

    Figures from this paper

    References

    SHOWING 1-10 OF 17 REFERENCES
    Inductive Inference of Chess Player Strategy
    • 17
    A theoretical and empirical investigation of search in imperfect information games
    • 36
    Risk Management in Game-Tree Pruning
    • 11
    • PDF
    Some Studies in Machine Learning Using the Game of Checkers
    • 2,207
    • PDF
    Some studies in machine learning using the game of checkers. II: recent progress
    • 583
    Exact and approximate algorithms for partially observable markov decision processes
    • 426
    Reinforcement Learning: An Introduction
    • 27,492
    • PDF
    Planning and Acting in Partially Observable Stochastic Domains
    • 3,612
    • PDF