Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : IJISTECH

Comparison of Ascent Hill Climbing Algorithm And Simple Hill Climbing Algorithm Solving The 8-Puzzle Case Padma Mike Putri M
IJISTECH (International Journal of Information System and Technology) Vol 5, No 5 (2022): February
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v5i5.175

Abstract

Puzzle 8 game is a game that shifts numbers in the form of a box consisting of 9 squares arranged with numbers 1 to 8 based on the order of count and there is an order of 3x3. This form of game is very easy to complete if you follow the rules that have been applied to the algorithm. Comparison of the ascent hill climbing algorithm and the simple hill climbing algorithm. The purpose of this algorithm is to help children who are just learning to arrange a sequence of numbers so that they explore brain power and increase imagination for children. The difference between the ascent hill climbing algorithm and the simple hill climbing algorithm lies in the search movement which does not start from the far left position but the next movement is searched based on the best heuristic value. To obtain the Goal, a systematic process is needed to make it easy and fast in finding solutions so as to save time in finding the final goal.
Search Optimization of The Shortest Route Using the Generate And Test Algorithm Padma Mike Putri M
IJISTECH (International Journal of Information System and Technology) Vol 6, No 1 (2022): June
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v6i1.209

Abstract

Searching is a search method that belongs to the science of Artificial intelligence. The Generate and Test algorithm is able to solve problems related to heuristic searches in the terminology of Artificial Intelligence. The problem that often occurs is the user's lack of understanding about the completion of the General and Test Algorithm so that it takes a lot of time and money to get the final value, for that we need a completion of the shortest path search to minimize costs and time. The General And test method is a method of solving search cases The shortest path using several points and weights of the journey where all points must be visited once and the end point of the journey is the same as the starting point of the journey. The final benefit of this research helps users to find a very good alternative to take a decision.