|
Greedy strategy for some normal m x n closing octagons games andwinning strategy for normal 1 x n and 2 x n closing octagons games |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Ratinan Boonklurb 2. Thitiphut Leelathanakit |
| Title | Greedy strategy for some normal m x n closing octagons games andwinning strategy for normal 1 x n and 2 x n closing octagons games |
| Publisher | Research and Development Office, Prince of Songkla University |
| Publication Year | 2564 |
| Journal Title | Songklanakarin Journal of Science and Technology (SJST) |
| Journal Vol. | 43 |
| Journal No. | 1 |
| Page no. | 105-110 |
| Keyword | closing octagons game, combinatorial game, 2-person game, strategy |
| URL Website | https://rdo.psu.ac.th/sjstweb/index.php |
| ISSN | 0125-3395 |
| Abstract | m x n Closing Octagons (CO) game is a combinatorial game for two players. The game starts with an m x n array ofoctagons such that every two adjacent octagons has one common side and 0 points. Players alternately turn by the followingrules. (i) A player moves by coloring one side of an octagon. (ii) A player who colors the eighth side of k octagons earns k pointsand gets one more move. The game ends when every side of the octagons has been colored and the player with the most pointswins. This game is formulated into a new CO game using graphs. In order to analyze it, more rules are added and the game withthese additional rules is called a normal m x n CO game. In this article, we give a greedy strategy for some normal m x n COgames and a winning strategy for normal 1 x n and 2 x n CO games. |
