-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.c
59 lines (50 loc) · 1.67 KB
/
test.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
//
// sudoku - A SuDoKu solver
//
// Copyright (c) 2018 Linde Labs, LLC
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "sudoku.h"
static char *test_boards[] = {
// TODO: Add your built-in test boards here. One string per board.
};
int run_built_in_tests()
{
struct sudoku_board *board;
int i, solutions_count;
for(i = 0; i < (sizeof(test_boards)/sizeof(*test_boards)); i++) {
printf("\n===== Test board %i =====\n\n", i);
board = create_board();
board->debug_level = 1;
read_board(board, test_boards[i]);
printf("-------- Input --------\n");
print_board(board);
printf("---Solve---\n");
solutions_count = solve(board);
if (solutions_count)
printf("Found %i solution(s)\n", solutions_count);
else
printf("No solution found\n");
printf("-------- Output -------\n");
print_solutions(board);
assert(solutions_count);
destroy_board(&board);
if (solutions_count == 0)
return -1;
}
printf("\nAll %i built-in tests PASS\n\n", i);
return 0;
};