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 SAT problem as an example. Then it takes the implementation of the Grover's search to the next level, covering the problems with unknown number of solutions.
You can run the SolveSATWithGrover kata as a Jupyter Notebook!
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.