MÉTODOS DE BUSCA PARA RESOLUÇÃO DE UM JOGO DE SUDOKU

Abstract

This article aims to describe a Java implementation to solve a Sudoku game through blind and heuristic search. Thus, starting from the use of known concepts about the subjects presented and the specifications of the work, the solution is restricted to conventional 9x9 Sudoku games. In addition, it was evidenced that we can use different techniques to find solutions of this game, and can be used finite platforms and programming languages to be able to implement them, not being restricted to only one method.