need guidance about minimax

i want to know minimax algorithm how really gets implemented. for example as we know min is a player and max is other player. both of them try maximize their own performance and minimizer other ones. so the main question is: does both of them have a complete information of every state? and it has to be generated? in most of examples i search it searchs in a tree. i think there should be other ways to search for that. for example in a game like tic tack toe you can simply find all possible states. you can save every state in a 2d array and program that best choice for this state is this one. one other question can be: for a game like chess states can be so…


Link to Full Article: need guidance about minimax