Advertisement
7_2009-2012 OLE/ COM/ DCOM/ Active-X #227028

An Advanced TicTacToe game using *MiniMax Algorithm*

This is a complete Tictactoe game, it includes many functionalities, you can play games against another human, you can play against the computer, you can also even let the computer play against itself. The A.I is very good, actualy it is unbeatable, the most you can do is to draw the games. Also, the game include statistics (number of win, draw an lost games) for the current match between players. The A.I for this tictactoe game is an implementation of the MiniMax Algorithm, the algorithm was implemented by using three functions, Minimax(...), MinMove(...) and MaxMove(...), as you probably may have guest it, the main function in this algorithm is MiniMax(...), it returns the best move for the current computer player. To be capable of choosing the best move, the program takes time to generate all the possible outcomes for the current board position and at the same time, it decide wich one is the best.

AI

Ringkasan AI: This codebase represents a historical implementation of the logic described in the metadata. Our preservation engine analyzes the structure to provide context for modern developers.

Kode Sumber
original-source
Upload
Komentar Asli (3)
Dipulihkan dari Wayback Machine