The comparison of steepest ascent hill climbing and a-star for classic game

Zulfikar, Wildan Budiawan and Irfan, Mohamad and Yahya, Rijal Muharom and Ramdania, Diena Rauda and Jumadi, Jumadi (2021) The comparison of steepest ascent hill climbing and a-star for classic game. In: ICWT 2021.

This is the latest version of this item.

[img]
Preview
Text (artikel)
Hill Climbing 00 artikel.pdf

Download (309kB) | Preview
[img]
Preview
Text (conference)
Hill Climbing 00 conference.pdf

Download (2MB) | Preview
[img]
Preview
Text (corresponding)
Hill Climbing 00 corresponding.pdf

Download (2MB) | Preview
[img]
Preview
Text (similarity)
Hill Climbing 00 similarity.pdf

Download (2MB) | Preview

Abstract

Tic-tac-toe is a classic game that remains popular today. This game requires two players. When applied to software, of course this game requires an AI-integrated bot as an opponent to play. Several algorithms can be used as artificial intelligence in tic-tac-toe games such as Steepest Ascent Hill Climbing and A-star. The purpose of this research is to find a more effective and efficient algorithm for this game. The components used to compare the two algorithms are the elapsed time and also the performance of the two algorithms. SAHC recorded a shorter elapsed time with 0.0448 ms compared to the A-star which recorded an average of 1.192 ms. However, based on other tests case, A-star performs better than SAHC.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: tic tac toe; steepest ascent; hill climb; a-star
Subjects: Data Processing, Computer Science
Divisions: Fakultas Sains dan Teknologi > Program Studi Teknik Informatika
Depositing User: Wildan Budiawan Zulfikar
Date Deposited: 02 May 2023 02:37
Last Modified: 02 May 2023 03:20
URI: https://digilib.uinsgd.ac.id/id/eprint/67088

Available Versions of this Item

Actions (login required)

View Item View Item