Let $`N`$ be the number of pegs in the code and $`C`$ be the number of possible peg colors. We will call a game with these particular parameters a $`(N, C)`$-game. A *code* is a vector in $`\BbbC = \{0, \ldots, C - 1\}^N`$. The number of possible codes is $`M = C^N`$. The game is played as follows:
Let $`N`$ be the number of pegs in the code and $`C`$ be the number of possible peg colors. We will call a game with these particular parameters a $`(N, C)`$-game. A *code* is a vector in $`\mathbb{C} = \{0, \ldots, C - 1\}^N`$. The number of possible codes is $`M = C^N`$. The game is played as follows:
1. The codemaker chooses a secret code $`c`$.
2. The codebreaker tries to guess $`c`$ in as few iterations as possible. At each iteration $`t`$ :
