Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Possible Duplicate:
What Algorithm for a Tic-Tac-Toe Game Can I Use To Determine the “Best Move” for the AI?
I want to develop a tic tac toe (5×7) game in which there are two players one is computer and one is human.
the player who makes 4 in a row
or 4 in diagonal first wins. If i do using brute force technique it takes long time for computer to decide next move. Can anyone suggest an algorithm with less time complexity ?
thanks in advance..
Alpha-Beta prunning is a good algorithm for searching for the best next turn.