Browse > Article
http://dx.doi.org/10.9717/kmms.2017.20.4.696

A Method to Expand a Complete Binary Tree using Greedy Method and Pruning in Sudoku Problems  

Kim, Tai Suk (Dept. of Computer Software Engineering, Dong-Eui University)
Kim, Jong Soo (Dept. of System Management, Korea Lift College)
Publication Information
Journal of Korea Multimedia Society / v.20, no.4, 2017 , pp. 696-703 More about this Journal
Abstract
In this paper, we show how to design based on solving Sudoku problem that is one of the NP-complete problems like Go. We show how to use greedy method which can minimize depth based on tree expansion and how to apply heuristic algorithm for pruning unnecessary branches. As a result of measuring the performance of the proposed method for solving of Sudoku problems, this method can reduce the number of function call required for solving compared with the method of heuristic algorithm or recursive method, also this method is able to reduce the 46~64 depth rather than simply expanding the tree and is able to pruning unnecessary branches. Therefore, we could see that it can reduce the number of leaf nodes required for the calculation to 6 to 34.
Keywords
Sudoku Solver; Algorithm; Artificial Intelligent; Strategy; Complete Binary Tree Search; AlphaGo;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 A. Hulpke, P. Kaski and P.R.J. OSTERGARD, "The Number of Latin Squares of Order 11," math.CO., arXiv.org, pp. 1-22, 2010.
2 T.S. Kim and J.S. Kim, "A Comparative Study of Solver of 9x9 Normal Sudoku," Proceedings of the Korea Multimedia Society Conference, pp. 232-237, 2016.
3 T.S. Kim and J.S. Kim, "A Study on the Undo Function Implementation using the Design Patterns," Journal of the Korea Industrial Information Systems Research, Vol. 19, No. 8, pp. 1544-1522, 2016.
4 J.S. Kim and T.S. Kim, "Design of Network-based Game using the GoF Design Patterns," Journal of Korea Multimedia Society, Vol. 9, No. 6, pp. 742-749, 2006.
5 David Silver, A. Huang, C.J. Maddison, A. Guez, L. Sifre, and G.V.D. Driessche et al., "Mastering the Game of Go with Deep Neural Networks and Tree Search," Nature, Vol 529, pp. 1-37, 2016.   DOI
6 H.J. Yang, H.Y. Jang, and B.T. Zhang, "Monte Carlo Tree Search for a Board Game with Nonconsecutive Turns," Proceedings of Korea Institute of Information Scientists and Engineers, pp. 1717-1719, 2014.
7 P-NP Problem, http://www.wikipedia.org, (accessed Nov., 5, 2016).
8 Computational Complexity Theory, http://www.aistudy.com, (accessed Nov., 5, 2016).
9 Hodoku, http://hodoku.sourceforge.net/en/index.php, (accessed Jun., 3, 2016).
10 Recursive Method for Solving Sodoku, http://sunnyholic.com/81, (accessed Nov., 7, 2016).
11 Google AlphaGo, https://www.wikipedia.org, (accessed Feb., 1, 2016).