An application of artificial intelligence in game theory

In this thesis, minimax algorithm had been explained and an application had been applied using this algorithm. What is Minimax algorithm, discussed the operation principle. Explanation of the algorithm described by game trees. Minimax algorithm application is explained how to use this algorithm in a game program. This algorithm is used for chess program. Playing chess against the computer, the computer determines the move using minimax algorithm. Users play white pieces and computer plays the black pieces. This game to be written by java as the programming language.The rules of chess had been introduced briefly in the introduction. Search algorithms had been told in the introduction, generally referred to as artificial intelligence, such as game theory.What is the minimax algorithm? How is working operating prinsible? The algorithm of scheme had been told in second part of thesis. How the evaluation algorithm is shown through the game program. Evaluation criteria for the evaluation of the game is to use two. Static evaluation of the stones, the stones had been based on the type. Dynamic evaluation of the stones had been based to the location of the chessboard. Static and dynamic values of the stones collected for all possible moves and it had been sent to minimax algorithm. Minimaks algorithm, the computer will be be done the best move, after evaluating all posible moves is determined.How is written chess game? It had been told in the third part of thesis. The user interface is realized using Java graphics library. Movement of the stones used in the java animation. Movement of the pieces had been provided using drag and drop. Warning messages had been displayed when the king is pulled and the game is finished and wrong moves is made. Written to a method for each type of stone. These mehods are the rule of chess for the type of stone. For example the method of pawn, pawn square forward movement, the forward movement of the two moves, the right or left of the competitor to take this of opposite player have the stone, the implementationof the rule of en passant and pawn reaches the rank of the last, it can change type of stone. When it moves the stone, that all possible moves is controlledwith current moving. In addition, volume method was added to the warning given in this method provided after each valid moves.The fourth section had been section of result.In this thesis, the success of the proposed algorithm to the game of chess, in both static and dynamic evaluations of trials tested.Proposed in the original assessments made in this thesis has provided significant performance gains in case of dynamic grading.