@article{Ammar_Arzaki_Wulandari_2024, title={Note on Algorithmic Investigations of Juosan Puzzles}, volume={17}, url={https://jiki.cs.ui.ac.id/index.php/jiki/article/view/1184}, DOI={10.21609/jiki.v17i1.1184}, abstractNote={<p>We investigate several algorithmic and mathematical aspects of the Juosan puzzle—a one-player pencil-and- paper puzzle introduced in 2014 and proven NP-complete in 2018. We introduce an optimized backtracking technique for solving this puzzle by considering some invalid subgrid configurations and show that this algorithm can solve an arbitrary Juosan instance of size <em>m × n</em> in <em>O(2<sup>mn</sup>)</em> time. A C++ implementation of this algorithm successfully found the solution to all Juosan instances with no more than 300 cells in less than 15 seconds. We also discuss the special cases of Juosan puzzles of size <em>m × n</em> where either m or n is less than 3. We show that these types of puzzles are solvable in linear time in terms of the puzzle size and establish the upper bound for the number of solutions to the Juosan puzzle of size <em>1 × n</em>. Finally, we prove the tractability of arbitrary <em>m × n</em> Juosan puzzles whose all territories do not have constraint numbers.</p>}, number={1}, journal={Jurnal Ilmu Komputer dan Informasi}, author={Ammar, Muhammad Tsaqif and Arzaki, Muhammad and Wulandari, Gia Septiana}, year={2024}, month={Feb.}, pages={19-35} }