Effects of Dynamic Variable - Value Ordering Heuristics on the Search Space of Sudoku Modeled as a Constraint Satisfaction Problem

  • James L. Cox Brooklyn College of New York
  • Stephen Lucci The City College of New York
  • Tayfun Pay Graduate Center of New York
Keywords: Constraint Satisfaction Problems, Backtracking-Search, Dynamic Variable Ordering Heuristics

Abstract

We carry out a detailed analysis of the effects of different dynamic variable and value ordering heuristics on the search space of Sudoku when the encoding method and the filtering algorithm are fixed. Our study starts by examining lexicographical variable and value ordering and evaluates different combinations of dynamic variable and value ordering heuristics. We eventually build up to a dynamic variable ordering heuristic that has two rounds of tie-breakers, where the second tie-breaker is a dynamic value ordering heuristic. We show that our method that uses this interlinked heuristic outperforms the previously studied ones with the same experimental setup. Overall, we conclude that constructing insightful dynamic variable ordering heuristics that also utilize a dynamic value ordering heuristic in their decision making process could drastically improve the search effort for some constraint satisfaction problems.

Downloads

Download data is not yet available.
Published
2019-01-10
How to Cite
Cox, J., Lucci, S., & Pay, T. (2019). Effects of Dynamic Variable - Value Ordering Heuristics on the Search Space of Sudoku Modeled as a Constraint Satisfaction Problem. Inteligencia Artificial, 22(63), 1-15. https://doi.org/10.4114/intartif.vol22iss63pp1-15