This kata continues the exploration of the Grover's search algorithm started in the "Grover's Algorithm" kata. It teaches writing oracles for the algorithm which describe the problem instead of the solution, using graph coloring problem as an example. Then it takes the implementation of the Grover's search to the next level, covering solving the problems with unknown number of solutions.

• This Microsoft Learn module walks you through solving graph coloring problems using Grover's search.
• You can read more about graph coloring problems on Wikipedia.
• It is strongly recommended to complete the Grover's Algorithm kata before proceeding to this one. You can also refer to its README.md for the list of resources on Grover's algorithm.
• SolveSATWithGrover is another kata covering oracle implementation for solving constraint satisfaction problems.