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.
Zhivko, N (2024). Algorithm for compressing/decompressing Sudoku grids. Afribary. Retrieved from https://afribary.com/works/algorithm-for-compressing-decompressing-sudoku-grids
Zhivko, Nedev "Algorithm for compressing/decompressing Sudoku grids" Afribary. Afribary, 30 Mar. 2024, https://afribary.com/works/algorithm-for-compressing-decompressing-sudoku-grids. Accessed 22 May. 2024.
Zhivko, Nedev . "Algorithm for compressing/decompressing Sudoku grids". Afribary, Afribary, 30 Mar. 2024. Web. 22 May. 2024. < https://afribary.com/works/algorithm-for-compressing-decompressing-sudoku-grids >.
Zhivko, Nedev . "Algorithm for compressing/decompressing Sudoku grids" Afribary (2024). Accessed May 22, 2024. https://afribary.com/works/algorithm-for-compressing-decompressing-sudoku-grids