The games are played with a strategy. Each player or team will formulate a strategy before starting the game and they must change or formulate a new strategy according to the current situation (s) in the game.
You also have to consider computer games with the same strategy as mentioned above. Note that search algorithms are those that detect strategy in computer games.
The goal of the search algorithm is to find the optimal set of moves so that they reach the final destination and win. These algorithms use a winning set of different conditions for every game, to find the best moves.
Imagine a computer game as a tree. We know that trees have nodes. Starting at the root, we can come to the final winning node, but with optimal moves. This is the work of search algorithms. Each node in such a tree represents a future state. Search algorithms search through this tree to decide on each stage or node of the game.
Comments
Post a Comment