Benchmarks
This page contains benchmark Sudoku puzzles for the competition. In the design archive that you are submitting to the competition, you must include the time it takes your Sudoku solver to solve these puzzles. If your design is unable to solve a particular puzzle by design, please indicate -1. You may choose to include runtime that exceed the maximum allowed time t
max for our reference. For more details about what to submit, see the
Design Submission page.
File Format
The file format for the sudoku puzzle is as follows:
The first line contains a positive integer that represents the order of the puzzle,
N.
Starting with the second line is the actual Sudoku puzzle. Each cell is represented by a positive integer, followed by
one space characters. An empty cell is represented by a "0", while a cell with "given" are represented by the given number.
Each line in the input file represents a row of cells listed from left-to-right. Each line is terminated by linefeed character, LF (0x0A).
Below is the input file that represents the sample Sudoku puzzle from the
Background page.
3
0 1 4 5 2 0 0 0 9
3 0 0 0 9 0 4 5 1
5 0 8 0 0 0 0 6 7
0 0 0 0 0 3 7 0 0
0 0 6 2 0 5 1 0 0
0 0 3 4 0 0 0 0 0
4 3 0 0 0 0 6 0 2
8 2 7 0 4 0 0 0 5
1 0 0 0 5 2 8 4 0
Download
The following software will help you in testing the functionality and performance of your design. You may use the result of the following software when reporting the performance of your design when you submit your design archive.
The software has been tested on Linux systems only.
