co18353 / tic-tac-toe Goto Github PK

In a competitive multiplayer game like Tic-Tac-Toe, a search algorithm cannot just take a sequence of steps to achieve the goal state as for each step towards the goal, there is an opposing factor which tries to alter the current state in an unfavourable manner. Minimax Algorithm is a tactic which works upon the fact that 2 players are working towards opposite goals and makes prediction which future state will be reached as the game is being played. That is, there will be an opposing factor that will try to minimize whatever value the player is maximizing.