Implementation Array List And Uniform Cost Search Algorithm In X-O Game
Daftar Isi:
- X-O game is the game which train our accuracy on blockade the way of our opponent and find the way for us to win this game. One player play with O as human player and the other play with X as computer player. The winner of this game is player who the first reach the 5 block. To reach the 5 block can be horizontal, vertical and cross. This game is not limited by the time. The computer use UCS (Uniform Cost Search) algorithm to find biggest point and decide which appropriate coordiante to move. This project created with Java programming and GUI programming. This project use Array List as a data structure to store data. This project use UCS as an algorithm for searching all data and decide computer movement. This data structure and algorithm make a simple and short in time to searching next move and blokade the user movement.