Solving the Oshi-Zumo Game

25 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

OpenSpiel: A Framework for Reinforcement Learning in Games (2019, background): “Game Reference(s) Status Backgammon Wikipedia Breakthrough Wikipedia Bridge bidding Wikipedia Coin Game [56] ∼ Connect Four Wikipedia Cooperative Box-Pushing [62] ∼ Chess Wikipedia First-price Sealed-bid Auction Wikipedia Go Wikipedia Goofspiel Wikipedia Havannah Wikipedia Hex Wikipedia ∼ Kuhn poker”
Heads-up limit hold’em poker is solved (2015, background): “The one near-exception to this claim is oshi-zumo, but it is not played competitively by humans and is a simultaneous-move game that otherwise has perfect information (49).”
Convergence of Monte Carlo Tree Search in Simultaneous Move Games (2013, methodology): “Simultaneous-move games can be solved exactly in polynomial time using the backward induction algorithm [7, 4], recently improved with alpha-beta pruning [8, 9].”
Algorithms for computing strategies in two-player simultaneous move games (2016, unknown): “Oshi-Zumo (also called Alesia in [22]) is a board game that has been analyzed from the perspective of computational game theory in [36].”