ai with python games are played with strategy every player or team would make strategy before starting the game and they have to change or build new strategy according to the current situation(sin the game search algorithms you will have to consider computer games also with the same strategy as above note that search algorithms are the ones that figure out the strategy in computer games how it works the goal of search algorithms is to find the optimal set of moves so that they can reach at the final destination and win these algorithms use the winning set of conditionsdifferent for every gameto find the best moves visualize computer game as the tree we know that tree has nodes starting from the rootwe can come to the final winning nodebut with optimal moves that is the work of search algorithms every node in such tree represents future state the search algorithms search through this tree to make decisions at each step or node of the game combinational search the major disadvantage of using search algorithms is that they are exhaustive in naturewhich is why they explore the entire search space to find the solution that leads to wastage of resources it would be more cumbersome if these algorithms need to search the whole search space for finding the final solution to eliminate such kind of problemwe can use combinational search which uses the heuristic to explore the search space and reduces its size by eliminating the possible wrong moves hencesuch algorithms can save the resources some of the algorithms that use heuristic to search the space and save the resources are discussed hereminimax algorithm it is the strategy used by combinational search that uses heuristic to speed up the search strategy the concept of minimax strategy can be understood with the example of two player gamesin which each player tries to predict the next move of the opponent and tries to minimize that function alsoin order to winthe player always try to maximize its own function based on the current situation heuristic plays an important role in such kind of strategies like minimax every node of the tree would have heuristic function associated with it based on that heuristicit will take the decision to make move towards the node that would benefit them the most