DLX-Sudoku-Solver

This is a C++ implementation of Donald Knuth's Algorithm X using the Dancing Links technique(DLX Algorithm).
Benchmarked the solver for 9x9 sudoku against 4 difficulty standards by 1000 boards of each to solve on average under 1 ms (max 7ms for any std of difficulty)
Benchmarking is done on 2 parameters(in a specific difficulty standard):
- Max time to solve any sudoku (in ms)
- Average time of 1000 sudoku (in ms)

Std	Simple	Easy	Intermediate	Expert
Max	4.00	4.00	7.00	4.00
Avg	0.85	1.19	1.11	0.87

Acknowledgements

Name		Name	Last commit message	Last commit date
Latest commit History 25 Commits
.gitattributes		.gitattributes
DancingLinks.cpp		DancingLinks.cpp
DancingLinks.h		DancingLinks.h
Dancing_Link_Algorithm.txt		Dancing_Link_Algorithm.txt
Knuth's_Algorithm_X.txt		Knuth's_Algorithm_X.txt
Node.cpp		Node.cpp
Node.h		Node.h
README.md		README.md
Results_easy_sudoku.png		Results_easy_sudoku.png
Results_expert_sudoku.png		Results_expert_sudoku.png
Results_intermediate_sudoku.png		Results_intermediate_sudoku.png
Results_simple_sudoku.png		Results_simple_sudoku.png
Sudoku.cpp		Sudoku.cpp
SudokuSolver.cpp		SudokuSolver.cpp
SudokuSolver.h		SudokuSolver.h
easy.txt		easy.txt
expert.txt		expert.txt
intermediate.txt		intermediate.txt
simple.txt		simple.txt
sudoku_brute_force.cpp		sudoku_brute_force.cpp