Comparison Analysis of Breadth First Search and Depth Limited Search Algorithms in Sudoku Game

IF 0.2 Q4 ENGINEERING, ELECTRICAL & ELECTRONIC University Politehnica of Bucharest Scientific Bulletin Series C-Electrical Engineering and Computer Science Pub Date : 2021-12-30 DOI:10.25008/bcsee.v2i2.1146

Tirsa Ninia Lina, Matheus Supriyanto Rumetna

{"title":"Comparison Analysis of Breadth First Search and Depth Limited Search Algorithms in Sudoku Game","authors":"Tirsa Ninia Lina, Matheus Supriyanto Rumetna","doi":"10.25008/bcsee.v2i2.1146","DOIUrl":null,"url":null,"abstract":"Sudoku is a game that sharpens the brain and is very well known. But the problem faced in this condition is how we can find a solution for the completion of this game. Problems with the Sudoku game can be solved by using the concept of Artificial Intelligence (AI). Some of the algorithms that can be used are the Breadth First Search (BFS) and Depth Limited Search (DLS) algorithms. The purpose of this research is to find a solution for Sudoku and make a comparative analysis of the search results of the two algorithms. The results obtained are application design in the form of a simulation of the completion of the Sudoku game problem with two algorithms. And it has been proven from the two algorithms that DLS is more efficient and faster than BFS. While BFS itself has advantages, in terms of a more structured and systematic search system that is able to find all possible numbers in each box. In this case, if a Sudoku question has more than one answer, then BFS will find it.","PeriodicalId":43514,"journal":{"name":"University Politehnica of Bucharest Scientific Bulletin Series C-Electrical Engineering and Computer Science","volume":null,"pages":null},"PeriodicalIF":0.2000,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"University Politehnica of Bucharest Scientific Bulletin Series C-Electrical Engineering and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25008/bcsee.v2i2.1146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}

引用次数: 9

Abstract

Sudoku is a game that sharpens the brain and is very well known. But the problem faced in this condition is how we can find a solution for the completion of this game. Problems with the Sudoku game can be solved by using the concept of Artificial Intelligence (AI). Some of the algorithms that can be used are the Breadth First Search (BFS) and Depth Limited Search (DLS) algorithms. The purpose of this research is to find a solution for Sudoku and make a comparative analysis of the search results of the two algorithms. The results obtained are application design in the form of a simulation of the completion of the Sudoku game problem with two algorithms. And it has been proven from the two algorithms that DLS is more efficient and faster than BFS. While BFS itself has advantages, in terms of a more structured and systematic search system that is able to find all possible numbers in each box. In this case, if a Sudoku question has more than one answer, then BFS will find it.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

数独游戏中宽度优先搜索与深度限制搜索算法的比较分析

数独是一种让大脑变得敏锐的游戏，非常有名。但在这种情况下，我们所面临的问题是如何找到一个解决方案来完成这个游戏。数独游戏的问题可以用人工智能(AI)的概念来解决。可以使用的一些算法是广度优先搜索(BFS)和深度限制搜索(DLS)算法。本研究的目的是为数独寻找一个解，并对两种算法的搜索结果进行比较分析。所获得的结果是以应用程序设计的形式模拟了用两种算法完成数独游戏问题。两种算法都证明了DLS算法比BFS算法更高效、更快。虽然BFS本身有优势，就更结构化和系统化的搜索系统而言，它能够在每个框中找到所有可能的数字。在这种情况下，如果一个数独问题有多个答案，那么BFS将找到它。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

University Politehnica of Bucharest Scientific Bulletin Series C-Electrical Engineering and Computer Science ENGINEERING, ELECTRICAL & ELECTRONIC-

CiteScore

0.70

自引率

33.30%

发文量