the ai' smarts for playing tic tac toe will follow simple algorithm an algorithm is finite series of instructions to compute result single program can make use of several different algorithms an algorithm can be represented with flow chart the tic tac toe ai' algorithm will compute the best move to makeas shown in figure - the ai' algorithm will have the following steps firstsee if there' move the computer can make that will win the game if there istake that move otherwisego to step see if there' move the player can make that will cause the computer to lose the game if there ismove there to block the player otherwisego to step check if any of the corner spaces (spaces or are free if somove there if no corner piece is freethen go to step check if the center is free if somove there if it isn'tthen go to step move on any of the side pieces (spaces or there are no more stepsbecause if the execution reaches step the side spaces are the only spaces left this all takes place in the "get computer' move box on the flow chart in figure - you could add this information to the flow chart with the boxes in figure - figure - the five steps of the "get computer' movealgorithm the arrows leaving go to the "check if computer wonbox post questions to