Nim's game miniproject implementation for CS-456 ANN class
Author: Eliott Zemour (eliott.zemour@epfl.ch)
Diffusion ann-nims-game (master)
Recent Commits
Recent Commits
| Commit | Author | Details | Committed | ||||
|---|---|---|---|---|---|---|---|
| 03cd7a3a8e49 | EliottZemour | aaa | Jan 9 2022 | ||||
| 77a5c85d1c04 | EliottZemour | commit | Nov 22 2021 | ||||
| a48c059dcc09 | EliottZemour | sarsa vs sarsa | Nov 21 2021 | ||||
| 52bcb0c112bf | EliottZemour | working sarsa vs optimal | Nov 17 2021 | ||||
| d9736eabb78b | EliottZemour | notebook+sarsa | Nov 15 2021 | ||||
| e3dec4e83ef7 | eliottzem | readme | Nov 1 2021 | ||||
| c12363f951a6 | eliottzem | update normal and random policies | Nov 1 2021 | ||||
| ba521b0d13e6 | eliottzem | first readme | Oct 24 2021 |
README.md
README.md
The game of Nim
The normal game is between two players and is played with _three heaps_ of any number of objects. The two players alternate taking any number of objects from any one of the heaps. The goal is to take the last remaining object. Therefore, in three-heaps setup, the winning position would look like: [0, 1, 0]
References:
c4science · Help