Add m,n,k-game entry in the docs

docs/games.md

@@ -57,6 +57,7 @@ Status                                                                 | Game
 🟢                                                                      | Mean Field Game: linear-quadratic                                                              | n/a     | ❌              | ✅            | Players are uniformly distributed and are then incentivized to gather at the same point (The lower the distanbce wrt. the distribution mean position, the higher the reward). A mean-reverting term pushes the players towards the distribution, a gaussian noise term perturbs them. The players' actions alter their states linearly (alpha * a * dt) and the cost thereof is quadratic (K * a^2 * dt), hence the name. There exists an exact, closed form solution for the fully continuous version of this game. References: [Perrin & al. 2019](https://arxiv.org/abs/2007.03458).
 🟢                                                                      | Mean Field Game: predator prey                                                                 | n/a     | n/a            | n/a          | References: [Scaling up Mean Field Games with Online Mirror Descent](https://arxiv.org/abs/2103.00623), [Scalable Deep Reinforcement Learning Algorithms for Mean Field Games](https://arxiv.org/abs/2203.11973), [Learning in Mean Field Games: A Survey](https://arxiv.org/abs/2205.12944).
 🟢                                                                      | Mean Field Game: routing                                                                       | n/a     | ❌              | ✅            | Representative player chooses at each node where they go. They has an origin, a destination and a departure time and chooses their route to minimize their travel time. Time spent on each link is a function of the distribution of players on the link when the player reaches the link. References: [Cabannes et. al. '21, Solving N-player dynamic routing games with congestion: a mean field approach](https://arxiv.org/pdf/2110.11943.pdf).
+🔶                                                                      | [m,n,k-game](https://en.wikipedia.org/wiki/M,n,k-game)                                         | 2       | ✅              | ✅            | Players place tokens to try and form a k-in-a-row pattern in an m-by-n board.
 🔶                                                                      | [Morpion Solitaire (4D)](https://en.wikipedia.org/wiki/Join_five)                              | 1       | ✅              | ✅            | A single player game where player aims to maximize lines drawn on a grid, under certain limitations.
 🟢                                                                      | Negotiation                                                                                    | 2       | ❌              | ❌            | Agents with different utilities must negotiate an allocation of resources. References: [Lewis et al. '17](https://arxiv.org/abs/1706.05125). [Cao et al. '18](https://arxiv.org/abs/1804.03980).
 🔶                                                                      | [Nim](https://en.wikipedia.org/wiki/Nim)                                                       | 2       | ✅              | ✅            | Two agents take objects from distinct piles trying to either avoid taking the last one or take it. Any positive number of objects can be taken on each turn given they all come from the same pile.