Algorithms_in_C++
1.0.0
Set of algorithms implemented in C++.
|
Sudoku Solver algorithm. More...
#include <iostream>
#include <array>
Namespaces | |
backtracking | |
Backtracking algorithms. | |
Functions | |
template<size_t V> | |
bool | backtracking::isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n) |
template<size_t V> | |
void | backtracking::printMat (const std::array< std::array< int, V >, V > &mat, int n) |
template<size_t V> | |
bool | backtracking::solveSudoku (std::array< std::array< int, V >, V > &mat, int i, int j) |
int | main () |
Sudoku Solver algorithm.
Sudoku (数独, sūdoku, digit-single) (/suːˈdoʊkuː/, /-ˈdɒk-/, /sə-/, originally called Number Place) is a logic-based, combinatorial number-placement puzzle. In classic sudoku, the objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 subgrids that compose the grid (also called "boxes", "blocks", or "regions") contain all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a single solution.
int main | ( | void | ) |
Main function