Algorithm for Compressing/Decompressing Sudoku Grids
Zhivko Nedev1, Murtala Adamu Zungeru1, Suykhun Khov2, Daravisal Dy2 & Kimkhung Sov2 Show affiliations
- Botswana International University of Science and Technology, Botswana
- Zaman University, Cambodia
Journal of Computer Science, Volume 16, Issue 9, pp. 1319–1324 · doi.org/10.3844/jcssp.2020.1319.1324
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.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Nedev, Z., Zungeru, M. A., Khov, S., Dy, D. & Sov, K. (2020). Algorithm for Compressing/Decompressing Sudoku Grids. Journal of Computer Science, 16(9), 1319–1324. https://doi.org/10.3844/jcssp.2020.1319.1324
- Licence
- CC BY 3.0
- Issue
- Volume 16, Issue 9
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
