The Comparison of Steepest Ascent Hill Climbing and A-star for Classic Game | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Monday, 30 June, IEEE Xplore will undergo scheduled maintenance from 1:00-2:00 PM ET (1800-1900 UTC).
On Tuesday, 1 July, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC).
During these times, there may be intermittent impact on performance. We apologize for any inconvenience.

The Comparison of Steepest Ascent Hill Climbing and A-star for Classic Game


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 a...Show More

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.
Date of Conference: 19-20 August 2021
Date Added to IEEE Xplore: 18 January 2022
ISBN Information:
Conference Location: Bandung, Indonesia

Contact IEEE to Subscribe

References

References is not available for this document.