Research Article Open Access

Algorithm for Compressing/Decompressing Sudoku Grids

Zhivko Nedev1, Murtala Adamu Zungeru1, Suykhun Khov2, Daravisal Dy2 and Kimkhung Sov2
  • 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.

Journal of Computer Science
Volume 16 No. 9, 2020, 1319-1324

DOI: https://doi.org/10.3844/jcssp.2020.1319.1324

Submitted On: 26 April 2020 Published On: 3 October 2020

How to Cite: 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

  • 2,775 Views
  • 1,443 Downloads
  • 0 Citations

Download

Keywords

  • Sudoku
  • Compression
  • Decompression
  • Algorithms
  • Data Structure