A Retrograde Approximation Algorithm for One-Player Can't Stop

@inproceedings{Glenn2006ARA,
  title={A Retrograde Approximation Algorithm for One-Player Can't Stop},
  author={James Glenn and Haw-ren Fang and Clyde P. Kruskal},
  booktitle={Computers and Games},
  year={2006}
}
A two-player, finite, probabilistic game with perfect information can be presented as a four-partite graph. For Can’t Stop, the graph is cyclic and the challenge is to determine the game-theoretical values of the positions in the cycles. In a previous paper we have presented our success on tackling one-player Can’t Stop. In this paper we prove the existence and uniqueness of the solution to two-player Can’t Stop, and present a retrograde approximation algorithm to solve it by incorporating the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

The nature of retrograde analysis for Chinese chess, part I

H.-r. Fang
ICGA Journal, • 2005
View 10 Excerpts
Highly Influenced

A retrograde approximate algorithm for one-player can’t stop

J. Glenn, H.-r. Fang, C. P. Kruskal
Accepted by CG’06 conference, • 2006
View 3 Excerpts
Highly Influenced

An optimal strategy for Yahtzee

J. Glenn
Technical Report CS-TR-0002, Loyola College, 4501 N. Charles St, Baltimore MD 21210, USA, May • 2006
View 1 Excerpt

The nature of retrograde analysis for Chinese chess, part II

H.-r. Fang
ICGA Journal, • 2005
View 1 Excerpt

Yahtzee: The solution

P. Woodward
Chance, 16(1):18–22, • 2003
View 1 Excerpt

6-piece endgames

K. Thompson
ICCA Journal, 19(4):215–226, • 1996
View 1 Excerpt

Similar Papers

Loading similar papers…