The goal of this challenge is to implement algorithm to solve given sudoku puzzles in testfile.
-
A sudoku is type of puzzle made out of 9x9 (81) numbers/cells which is considered to be further divided into 9 sub-grids of 3x3 matrix.
-
A valid sudoku contains the numbers 1-9 each 9 times while not breaking one simple rule: "A sub-grid, column or row can only contain each number once".
i.e Sudoku puzzle can be viewed as matrix is 9x9.
- Rows are counted from top to bottom.
- Rows are horizontal, counted vertically, defined by
y
. - Columns are counted from left to right.
- Columns are vertical, counted horizontally, defined by
x
Initially all the tests will fail with following output
Fill the before result
Solve the challenge to pass the tests
Fill the after result
To run tests locally install codecheck in local environment by running following command in terminal.
$ npm install codecheck -g
To run tests locally, run codecheck
command in terminal in the root folder
To run tests in web editor please click on RUN
button on left side of web editor
In answer.md write a brief explanation
- About how your code works
- Problems faced while solving the challenge
- How you solved those problems