Penerapan Metode Best First Search Pada Permainan Tic Tac Toe


  • Harvei Desmon Hutahaean STMIK Pelita Nusantara Medan



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.


Sandy S. Artificial Intelligence. Yogyakarta : Andy offset. 1993.

Sony Daniswara, Ryan. Mencari dan memperbaiki Handphone. Depok: kawan pustaka. 2005

Adipranata, dkk, 2007. Aplikasi Pencarian Rute Optimum pada Peta guna Meningkatkan Efisiensi Waktu Tempuh Pengguna Jalan Dengan Metode A* dan Best First Search. Jurnal Informatika Vol. 8, N0. 2

Kusumadewi, Sri. 2003. Artificial Intelligence (Teknik dan Aplikasinya), yogyakarta, Graha Ilmu.

Kusumadewi, Sri. 2003. Pengantar Kecerdasan Buatan. Yogyakarta, Graha Ilmu.

Zi, Nurullina. 2011. Implementasi Konsep Kecerdasan Buatan dengan Metode Best First Search (BFS) untuk Pembuatan Game Ular Tangga Modifikasi. Universitas Sumatera Utara.



How to Cite

Hutahaean, H. D. (2017). Penerapan Metode Best First Search Pada Permainan Tic Tac Toe. MEANS (Media Informasi Analisa Dan Sistem), 2(1), 1–6.



Daftar Artikel