GabrielTofvesson/sudoku
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update README to reflect latest changes

Browse Source
This commit is contained in:
Gabriel Tofvesson 2020-03-13 02:30:58 +01:00
parent d8f12f1262
commit c080db5dab
1 changed files with 4 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
README.md
View File

@ -39,8 +39,8 @@ or
## Compiling and running ## Compiling and running
To test the functionality, simply run `gcc -o sudoku main.c board.c`, then To test the functionality, simply run `gcc -o sudoku main.c board.c`, then
`./sudoku [filename]`, where the given file is formatted according to the `./sudoku [-v[v]] {filename}`, where the given file is formatted according to
aforementioned specifications. the aforementioned specifications.
## Optimization ## Optimization
An optimization directive has been included in `board.c` to allow for the near An optimization directive has been included in `board.c` to allow for the near
@ -49,17 +49,13 @@ optimization, simply add `-DOPTIMIZE` to your compiler flags.
## Live status output ## Live status output
If you would like to get a live status output of speculative value placement, If you would like to get a live status output of speculative value placement,
add the `-DPRINT_STATUS=[mask]` to your compiler flags. The mask specifies the include the `-v` for verbose-mode solving (or `-vv` for more verbosity) when
bitmask to be applied when determining after how many iterations to print a running the sudoku program.
board to the output. For example, `-DPRINT_STATUS=0xFFF` should print a board
every 4096th (0x1000) call to the simplification algorithm.
## TODO ## TODO
* Optimizations * Optimizations
* Per-quadrant bit-field of populated values
* Packed structures * Packed structures
* Better structure layouts * Better structure layouts