|
|
TODO |
|
|
\ No newline at end of file |
|
|
# Introduction
|
|
|
|
|
|
TODO: Introduce game rules and related work.
|
|
|
|
|
|
## Notations
|
|
|
|
|
|
Let $N$ be the code length and $C$ be the number of possible colors. A code is a vector in $\{0, \dots, C - 1\}^N$. The number of possible codes is $M = C^N$.
|
|
|
|
|
|
# Exhaustive strategies |