Implementasi Algoritma Best First Search Untuk Melakukan Penyelesaian Game Sudoku

Query: Journal of information systems

article

Dwi Resty Ananda¹  Tommy Tommy²  Kalvin Chiuloto² 

[1] Universitas Sumatera Utara;Universitas Harapan Medan Indonesia

关键词: Sudoku;    algorithm;    BFS;   

DOI  :  10.58836/query.v6i2.14569

来源: Univesitas Islam Negeri Sumatera Utara

【 摘 要 】

The problem in this research is that the Sudoku puzzle game is difficult to solve because it is includedin the NP-complete problem, so it cannot be solved at the same time. Until now, many programmersare looking for the right algorithm to solve this puzzle. One way to solve this game is to use the bestfirst search algorithm. This algorithm is an improvement of the Brute Force algorithm, wheresolutions can be found with fewer searches and can find solutions to problems more efficientlybecause there is no need to check all possible solutions. Only searches that lead to solutions need tobe considered. The results of this study are the application of the best first search method in thesudoku game and determine the performance of the best first search method in the sudoku game. Thisresearch was built using Unity 3D software with the C# programming language and then using theunified modeling language as the flow of the diagram in the Sudoku game.

【 授权许可】

Unknown