Algorithm for compressing/decompressing Sudoku grids

Subscribe to read and download this work.

Abstract:

We describe a way to transfer efficiently Sudoku grids through

the Internet. This is done by using linearization together with compression

and decompression that use the information structure present in all sudoku

grids. The compression and the corresponding decompression are based on

the fact that in each Sudoku grid there are information dependencies and so

some of the information is redundant.