Algorithm for compressing/decompressing Sudoku grids

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.

Subscribe to access this work and thousands more
Overall Rating

0

5 Star
(0)
4 Star
(0)
3 Star
(0)
2 Star
(0)
1 Star
(0)
APA

Zhivko, N (2024). Algorithm for compressing/decompressing Sudoku grids. Afribary. Retrieved from https://afribary.com/works/algorithm-for-compressing-decompressing-sudoku-grids

MLA 8th

Zhivko, Nedev "Algorithm for compressing/decompressing Sudoku grids" Afribary. Afribary, 30 Mar. 2024, https://afribary.com/works/algorithm-for-compressing-decompressing-sudoku-grids. Accessed 30 May. 2024.

MLA7

Zhivko, Nedev . "Algorithm for compressing/decompressing Sudoku grids". Afribary, Afribary, 30 Mar. 2024. Web. 30 May. 2024. < https://afribary.com/works/algorithm-for-compressing-decompressing-sudoku-grids >.

Chicago

Zhivko, Nedev . "Algorithm for compressing/decompressing Sudoku grids" Afribary (2024). Accessed May 30, 2024. https://afribary.com/works/algorithm-for-compressing-decompressing-sudoku-grids