earticle

논문검색

Solving Sudoku Puzzles Based on Customized Information Entropy

초록

영어

Conception and calculation method of information entropy is customized for Sudoku puzzles and a corresponding algorithm is designed to solve Sudoku puzzles. The definitions of inverse information entropy and information amount for inverse information entropy are also introduced and directly used instead of information entropy in order to simplify the solving procedure. Experimental results show that the algorithm has better time efficiency than available methods including generic algorithms and rule based algorithms and it can solve not only unique-solution puzzles (including extremely difficult puzzles) but also multiple-solution puzzles. It is concluded that information entropy can be used for grading Sudoku puzzles as well.

목차

Abstract
 1. Introduction
 2. Preliminary
  2.1. Entropy and Information Entropy
  2.2. Customized Information Entropy for Sudoku
  2.3. Inverse Information Entropy and Information Amount for Inverse Information Entropy
 3. Methodology
  3.1. Initialization and Synchronization of IAIIEs
  3.2. Straightforward Solving Procedure
  3.3. Backtracking Based Solving Procedure
  3.4. Acquiring the Execution Time of Algorithm
 4. Empirical Studies
  4.1. Prototype Implementation
  4.2. Compared with AI Methods
  4.3. Compared with Rule based Methods
 5. Discussion about Difficulty Grading Based on Customized Information Entropy
 6. Summary
 Acknowledgements
 References

저자정보

  • Gaoshou Zhai School of Computer and Information Technology, Beijing Jiaotong University
  • Junhong Zhang School of Computer and Information Technology, Beijing Jiaotong University, School of Electrical and Information Engineering, Beijing University of Civil Engineering and Architecture

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.