#12 Update README.md

This commit is contained in:
Sacha Ligthert 2025-01-27 00:59:29 +01:00
parent 74f1fb63e1
commit 3f6ba6e9dc

View File

@ -9,10 +9,19 @@ _(This was a learning project to get a better grasp of Golang. But more importan
I wrote [a blog post](https://blog.ligthert.net/posts/exploration-fun-and-process-cycles-of-sudoku/) about this. I wrote [a blog post](https://blog.ligthert.net/posts/exploration-fun-and-process-cycles-of-sudoku/) about this.
## Features
* Worlds least efficient Sudoku solver
* Ability to assign a number of CPU cores to this task
* Split workloads among several computers
## Usage ## Usage
To use the sudoku solver, run the binary with all the parameters available: To use the sudoku solver, run the binary with all the parameters available:
``` ```
Usage of ./sudoku-funpark: Usage of ./sudoku-funpark:
-numcpu int
Number of CPU cores to assign to this task. (default 12)
-part int
Process part x in n parts. Cannot be lower than 1, or higher than specified in split. (default 1)
-row1 string -row1 string
1st row of the sudoku puzzle. (default "000000000") 1st row of the sudoku puzzle. (default "000000000")
-row2 string -row2 string
@ -31,6 +40,8 @@ Usage of ./sudoku-funpark:
8th row of the sudoku puzzle. (default "000000000") 8th row of the sudoku puzzle. (default "000000000")
-row9 string -row9 string
9th row of the sudoku puzzle. (default "000000000") 9th row of the sudoku puzzle. (default "000000000")
-split int
Split the tasks in n parts. This depends on the availability of the first row. (default 1)
``` ```
Instead of using the 3x3 blocks with 3x3 digits, it uses horizontal rows from top to bottom. Instead of using the 3x3 blocks with 3x3 digits, it uses horizontal rows from top to bottom.