Computing Strong Game-Theoretic Strategies in Jotto

@inproceedings{Ganzfried2011ComputingSG,
  title={Computing Strong Game-Theoretic Strategies in Jotto},
  author={Sam Ganzfried},
  booktitle={ACG},
  year={2011}
}
We develop a new approach that computes approximate equilibrium strategies in Jotto, a popular word game. Jotto is an extremely large two-player game of imperfect information; its game tree has many orders of magnitude more states than games previously studied, including no-limit Texas Hold’em. To address the fact that the game is so large, we propose a novel strategy representation called oracular form, in which we do not explicitly represent a strategy, but rather appeal to an oracle that… Expand
1 Citations
Myopic Best-Response Learning in Large-Scale Games
  • 3
  • PDF

References

SHOWING 1-9 OF 9 REFERENCES
Approximating Game-Theoretic Optimal Strategies for Full-scale Poker
  • 251
  • PDF
On the Rate of Convergence of Fictitious Play
  • 26
  • PDF
Games with Incomplete Information Played by "Bayesian" Players, I-III: Part I. The Basic Model&
  • J. Harsanyi
  • Mathematics, Computer Science
  • Manag. Sci.
  • 2004
  • 1,926
  • Highly Influential
  • PDF
ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION
  • 2,076
Iterative solutions of games by fictitious play
  • Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation
  • 1951
Official tournament and club word list
  • Official tournament and club word list