Requiem wins Nonogram tournament

Chen, L.-P. & Huang, K.-C. (2018). Solving Nonogram puzzles by using group-based fully probing. ICGA Journal, 40(4), 387–396. doi:10.3233/ICG-180067.

Chen, Y.-C. & Lin, S.-S. (2019). A fast Nonogram solver that won the TAAI 2017 and ICGA 2018 Tournaments. ICGA Journal, 41(1), 2–14. doi:10.3233/ICG-190097.

Guo, Y.-R., Huang, W.-C., Yeh, J.-J., Chang, H.-Y. & Huang, K.-C. (2019). On efficiency of fully probing mechanisms in Nonogram. In The Sixteenth Conference on Advances in Computer and Games (ACG2019), China: Macao.

Huang, K.-C., Yeh, J.-J., Huang, W.-C., Guo, Y.-R. & Chen, L.-P. (2018). Exploring effects of fully probing sequence on solving nonogram puzzles. ICGA Journal, 40(4), 397–405. doi:10.3233/ICG-180069.

Wu, I.-C., Sun, D.-J., Chen, L.-P., Chen, K.-Y., Kuo, C.-H., Kang, H.-H. & Lin, H.-H. (2013). An efficient approach to solving nonograms. IEEE Transactions on Computational Intelligence and AI in Games, 5(3), 251–264. doi:10.1109/TCIAIG.2013.2251884.