Proceedings of the Korea Information Processing Society Conference (한국정보처리학회:학술대회논문집)

  • 2006.11a
  • /
  • Pages.55-58
  • /
  • 2006
  • /
  • 2005-0011(pISSN)
  • /
  • 2671-7298(eISSN)
Korea Information Processing Society (한국정보처리학회)
권호 표지

Solving Sudoku as Constraint Satisfaction Problem

Sudoku 퍼즐의 구속조건만족문제 해법

  • Lee, Seung-Won (School of Engineering, lnformation and Communications University (ICU)) ;
  • Choi, Ho-Jin (School of Engineering, lnformation and Communications University (ICU))
  • 이승원 (한국정보통신대학교 공학부) ;
  • 최호진 (한국정보통신대학교 공학부)
  • Published : 2006.11.10
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents solving the Sudoku puzzle as a constraint satisfaction problem (CSP). After introducing the rules and characteristics of the puzzle, we formulate the puzzle as a CSP and develop various methods of solving the problem. Blind search, minimum remaining value (MRV) heuristic, and some advanced methods are investigated, and their algorithms are implemented in this undergraduate project. The performance comparisons of these methods are discussed in the paper.

Keywords