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

Implement persistent board complexity tracking

Browse Source
This commit is contained in:
Gabriel Tofvesson 2020-02-28 01:43:29 +01:00
parent 899e228b6d
commit 483d6ca1da
2 changed files with 36 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
board.c
View File

@ -300,6 +300,9 @@ board_place (
/* Set value */ /* Set value */
board_set (board, x, y, value); board_set (board, x, y, value);
/* Update board complexity */
board_refresh_complexity (board);
return true; return true;
} }
@ -307,3 +310,28 @@ board_place (
} }
else ERROR("Invalid parameters to function board_place()"); else ERROR("Invalid parameters to function board_place()");
} }
void
board_refresh_complexity (struct board *board)
{
board->complexity = 10;
for (board_pos y = 0; y < 9; ++y)
for (board_pos x = 0; x < 9; ++x)
if (! board_has_value (board, x, y))
{
struct board_element *elem = BOARD_ELEM (board, x, y);
if (elem->complexity < board->complexity)
{
board->complexity = elem->complexity;
/* Short-circuit function on comlpexity=1, since it can't go lower */
if (board->complexity == 1)
return;
}
}
/* If there are no complex board elements, board is solved */
if (board->complexity == 10)
board->complexity = 0;
}

8
board.h
View File

@ -184,3 +184,11 @@ board_place (
board_pos y, board_pos y,
element_value value element_value value
); );
/**
* Recomputes board complexity by searching all elements on board for the
* lowest complexity
*/
void
board_refresh_complexity (struct board *board);