Untitled

Wibowo, Adi; Budianto,; Lasguido,; Fathurrahman, Fahry

doi:10.21609/jiki.v4i1.153

Cited by 3 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Methods The analysis is carried out with the BFS and DLS algorithms [1], [3], [22], [23], [24], [25], [26], [27], [28], [29]. BFS is a search that is carried out by visiting each node systematically at each level until the goal state is found.…”

Section: ) Analysis Methodsmentioning

confidence: 99%

See 1 more Smart Citation

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

Lina

Rumetna

2021

Bulletin of Comp. Sci. Electr. Eng.

View full text Add to dashboard Cite

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.

show abstract

Section: ) Analysis Methodsmentioning

confidence: 99%

“…At the beginning of its creation, the computer only functioned as a calculating tool. But along with the times, computer technology is increasingly being improved and until now AI is often used to find solutions or solutions [1], [2]. In the case of AI there is a space that contains all the states which can be called a state space.…”

Section: Introductionmentioning

confidence: 99%

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

Lina

Rumetna

2021

Bulletin of Comp. Sci. Electr. Eng.

View full text Add to dashboard Cite

show abstract

“…Then, Similarity Comparison is carried out between the query image and the image in the database. The similarity distance between the query image and the image in the database will be sorted and displayed as output [8] Figure 1. Content Based Image Retrieval Diagram CBIR aims to capture images in databases that have visually similar content or features.…”

Section: Content Based Image Retrieval (Cbir)mentioning

confidence: 99%

Content Based Image Retrieval Method With Discrete Cosine Feature Extraction in Natural Images

2021

View full text Add to dashboard Cite

Data or information at this time is not only presented in written form, but also in the form of images that require greater storage. Most of the images in the digital world use the JPEG format, where the Discrete Cosine Transform is the heart of the JPEG format, the use of DCT coefficients for indexing and image retrieval causes the retrieving process to be slower because more coefficients are processed compared to the DC coefficient method, which is only 1 /64 (1 DC coefficient) of the DCT coefficient. In this research, we perform Content Based Image Retrieval with DC feature extraction of 15,000 natural images, then calculate the distance between the images using the Manhattan Distance method. The final result of calculating precision and recall shows a value of 0.6624 and a time of less than 2 seconds, with a maximum value of 1.876 seconds.

show abstract

Implementation of Breadth First Search Algorithm for Verification in the Informatics Engineering Education (PTI) UM

Akbar¹,

Prabowo²,

Purniawati³

et al. 2019

Proceedings of the 2nd International Conference on Vocational Education and Training (ICOVET 2018)

View full text Add to dashboard Cite

Courses are the requirement in completing a study; students are considered to have completed their learning process if they have passed all courses determined by the competence of the study program. Students who are yet to pass their credit (SKS) mean that they have not completed their study. Thus, a method which can be used to verify whether students have taken or passed the predetermined courses, one of which, is Breadth First Search (BFS). Such a method conducts a left-to-right screening process to search and verify the courses with algorithm, pseudocode, and graph being the implementation result of the BFS method.In terms of searching, there are four parameters involved: time, memory, complexity, and optimality. Based on the BFS method implementation, it is known that the time spent for the implementation is relatively short, since the BFS generated every possibility collectively, thus calculating the distance of each node is not necessary. The memory required is relatively small, since the BFS method is a blind search. The complexity is in the complete category, since all of the existing possibilities were generated followed by the left-to-right searching process. In terms of optimality, further research using different method was required for comparison.

show abstract

Untitled

Cited by 3 publications

References 4 publications

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

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

Content Based Image Retrieval Method With Discrete Cosine Feature Extraction in Natural Images

Implementation of Breadth First Search Algorithm for Verification in the Informatics Engineering Education (PTI) UM

Contact Info

Product

Resources

About