Implementasi Algoritma Best First Search Untuk Melakukan Penyelesaian Game Sudoku

Authors

  • Dwi Resty Ananda Universitas Sumatera Utara
  • Tommy Tommy Universitas Harapan Medan Indonesia
  • Kalvin Chiuloto Universitas Harapan Medan Indonesia

DOI:

https://doi.org/10.58836/query.v6i2.14569

Abstract

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

Author Biographies

Tommy Tommy, Universitas Harapan Medan Indonesia

Program Studi Teknik Informatika

Kalvin Chiuloto, Universitas Harapan Medan Indonesia

Program Studi Teknik Informatika

Downloads

Published

2022-11-13

Issue

VOLUME: 06, NUMBER: 02, OCTOBER 2022

Section

Articles

License

Creative Commons License

Authors who publish with this journal agree to the following terms:

  • that this article contains no violation of any existing copyright or other third party right or any material of a libelous, confidential, or otherwise unlawful nature, and that I will indemnify and keep indemnified the Editor and THE PUBLISHER against all claims and expenses (including legal costs and expenses) arising from any breach of this warranty and the other warranties on my behalf in this agreement;
  • that I have obtained permission for and acknowledged the source of any illustrations, diagrams or other material included in the article of which I am not the copyright owner.
  • on behalf of any co-authors, I agree to this work being published in Query: Jurnal Sistem Informasi as Open Access, and licenced under a Creative Commons Licence, 4.0 https://creativecommons.org/licenses/by/4.0/legalcode. This licence allows for the fullest distribution and re-use of the work for the benefit of scholarly information.