Algorithm for Compressing/Decompressing Sudoku Grids
- 1 Botswana International University of Science and Technology, Botswana
- 2 Zaman University, Cambodia
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.
DOI: https://doi.org/10.3844/jcssp.2020.1319.1324
Copyright: © 2020 Zhivko Nedev, Murtala Adamu Zungeru, Suykhun Khov, Daravisal Dy and Kimkhung Sov. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 3,436 Views
- 1,863 Downloads
- 0 Citations
Download
Keywords
- Sudoku
- Compression
- Decompression
- Algorithms
- Data Structure