EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Penerapan Metode Best First Search Pada Permainan Tic Tac Toe

Harvei Desmon Hutahaean

MEANS (Media Informasi Analisa dan Sistem) · 2017

DOI: 10.54367/means.v2i1.14 ↗

Kurz gefasst

Fachartikel in der Zeitschrift MEANS (Media Informasi Analisa dan Sistem), 2017. Verfasst von Harvei Desmon Hutahaean. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Search is the process of finding solutions in a problem until a solution or goal is found, or a movement in the state-space to search for trajectories from initial-state to goal-state. In a TIC TAC Toe game the process of finding a space situation is not enough to automate problem-solving behavior, in each of these situations there are only a limited number of choices that a player can make. The problems that will be faced can be solved by searching from the choices available, supported by the usual way of resolving. Best First Search works by searching for a directed graph which each node represents a point in a problem space.

Zitieren

APA

Hutahaean, H. D. (2017). Penerapan Metode Best First Search Pada Permainan Tic Tac Toe. MEANS (Media Informasi Analisa dan Sistem). https://doi.org/10.54367/means.v2i1.14

Vancouver

Hutahaean HD. Penerapan Metode Best First Search Pada Permainan Tic Tac Toe. MEANS (Media Informasi Analisa dan Sistem). 2017. doi:10.54367/means.v2i1.14

BibTeX
@article{Hutahaean2017,
  author = {Hutahaean, Harvei Desmon},
  title = {Penerapan Metode Best First Search Pada Permainan Tic Tac Toe},
  journal = {MEANS (Media Informasi Analisa dan Sistem)},
  year = {2017},
  doi = {10.54367/means.v2i1.14}
}
Kostenlos starten →