Penerapan Metode Best First Search Pada Permainan Tic Tac Toe | Zendy

Harvei Desmon Hutahaean | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Penerapan Metode Best First Search Pada Permainan Tic Tac Toe

Author(s) -

Harvei Desmon Hutahaean

Publication year - 2017

Publication title -

means (media informasi analisa dan sistem)

Language(s) - English

Resource type - Journals

eISSN - 2599-3089

pISSN - 2548-6985

DOI - 10.54367/means.v2i1.14

Subject(s) - computer science , search problem , graph , space (punctuation) , point (geometry) , state (computer science) , process (computing) , state space , mathematical optimization , node (physics) , mathematics , artificial intelligence , theoretical computer science , algorithm , engineering , statistics , geometry , structural engineering , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research