Loading...
Please wait, while we are loading the content...
Similar Documents
Combinatorial games: towers for the k-peg game.
| Content Provider | CiteSeerX |
|---|---|
| Author | Khan, Samee Ullah |
| Abstract | Abstract. The “Towers of Hanoi ” puzzle invented by Edouard Lucas in 1883 is one of the most widely studied problems in Computer Science. In this paper we will talk about a combinatorial game played by two players which has similar characteristics to that of the Towers of Hanoi problem, the k-peg game. We will introduce some of the known results, and show that this game is has a first player forced win. Introduction. Most of the combinatorial games have high computational costs, majority either belong to the class NP or the class PSPACE. On such family of games called the “pebble game” first introduced in [Kasai et al. 1979] are also mostly NP-complete. The pebble game is a conceptual game played on graphs with |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Combinatorial Game K-peg Game Pebble Game Known Result High Computational Cost Hanoi Puzzle Edouard Lucas Hanoi Problem Similar Characteristic Class Pspace Class Np First Player Conceptual Game |
| Content Type | Text |
| Resource Type | Article |
