How gabrieltofvesson/sudoku works
Project type and purpose
• This is a small, command-line C tool for solving Sudoku puzzles.
• Key indicators: single executable (main.c + board.c), no network or UI, just file I/O, a solver algorithm, and optional verbose logging.
File structure
• Top-level sources:
• main.c – CLI entry point, argument parsing, verbosity flags.
• board.c / board.h – core solver: data structures, constraint checks, backtracking/optimization.
• examples/ – sample input boards (text files) used as data sources.
• Config/build artifacts: none (Makefile TODO), but compile via gcc -o sudoku main.c board.c.
README for additional insights
• Describes input format (9×9 grid, ‘0’ or space for blanks).
• Explains optional compile-time optimization (-DOPTIMIZE) and runtime verbosity (-v, -vv).
• Mentions future refactoring: splitting printing and algorithm into separate modules.
Elements
[Filename + Flags] → CLI → Parser → BoardStruct → Solver → BoardStruct → Printer → stdout
• Blue rectangles for core algorithm (board.c/h)
• Green for I/O modules (file reader, printer)
• Orange for CLI/flags