RCOMM 2012 Sudoku Challenge: 1 - Generate All Possibilities

Process from the http://rcomm2012.org live data mining challenge. The task was to partially solve a Sudoku puzzle by solving three subtasks. Processes 1-3 in this pack are the actual solutions to the tasks, process 0 loads the required data into your repository and process 4 is the bonus that solves the entire puzzle.

This process loads the numbers 1..9 and uses two Cartesian Product operators to compute the set of all combinations x, y, v. Finally we compute the index of the 3x3 sub-field as z=ceil(x/3) + ceil(y/3) * 3 - 3. We end up with a table representing all values we could possibly insert into a Sudoku puzzle, i.e. any combination of column x, row y, and value v. The sub-field index z is implicitly defined by x and y but will help us later.

The result is saved in the table "All Possibilities" and will be used by process 2.

Note that the data set "All Possibilities" has the same format as the input data set "Sudoku Predefined" which contains the numbers that are predefined in the Sudoku puzzle.