Advertisement

Results for "Author: gonzales cenelia"

ASP_Volume3 #54177
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.

ASP_Volume3 #54178
Artificial Intelligence Chatbot Tutorial

This is a basic introduction to how to implement a chatbot in c++ or other programming languages

4_2005-2006 #159474
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.

4_2005-2006 #159475
Artificial Intelligence Chatbot Tutorial

This is a basic introduction to how to implement a chatbot in c++ or other programming languages

5_2007-2008 #181992
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.

5_2007-2008 #181993
Artificial Intelligence Chatbot Tutorial

This is a basic introduction to how to implement a chatbot in c++ or other programming languages

6_2008-2009 #204510
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.

6_2008-2009 #204511
Artificial Intelligence Chatbot Tutorial

This is a basic introduction to how to implement a chatbot in c++ or other programming languages

7_2009-2012 #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.

7_2009-2012 #227029
Artificial Intelligence Chatbot Tutorial

This is a basic introduction to how to implement a chatbot in c++ or other programming languages

Languages
Top Categories
Global Discovery