История

Alex Hansen 4e74bcdf70 update QDK version (#892 )		2023-09-19 11:43:09 -07:00
..
.vscode	Add DevSkim scanning and resolve initial alerts (#778 )	2022-04-22 16:47:21 -07:00
README.md	Remove most links to mybinder.org and add notes about its reduced capacity (#887 )	2023-06-08 09:06:01 -07:00
ReferenceImplementation.qs	Remove parenthesis around the condition in the if block (p2) (#853 )	2022-11-22 23:51:15 -08:00
SolveSATWithGrover.csproj	update QDK version (#892 )	2023-09-19 11:43:09 -07:00
SolveSATWithGrover.ipynb	Updates to new array creation syntax, part 3 (#762 )	2022-03-14 10:31:37 -07:00
SolveSATWithGrover.sln	Add "Solving SAT problems using Grover's search algorithm" kata (#79 )	2019-03-08 13:01:19 -08:00
Tasks.qs	Update to new array creation syntax (#709 )	2021-12-14 13:55:41 -08:00
Tests.qs	Remove parenthesis around the condition in the if block (p2) (#853 )	2022-11-22 23:51:15 -08:00
Workbook_SolveSATWithGrover.ipynb	Remove parenthesis around the condition in the if block (p2) (#853 )	2022-11-22 23:51:15 -08:00

README.md

Welcome!

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.

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.