Implementation Branch and Bound Algorithm in Snake Game
Daftar Isi:
- Snake game is a simple game which have a purpose for snake to find a way to finish. If the snake finds a wall, it must look for the other way until he find the finish. This project is created with Java Language Programming and use GUI for (Graphical User Interface) programming to the performance. This project uses Array and tree as a data structure. This project use Branch and Bound as an algorithm to move a snake to find the finish. Before playing the game snake, finish, wall and fruit must be set to the board. Then the snake is searching the way to the finish point while eating the fruit in the way. The snake will choose the path with fruit in it. The board itself can be set with a couple different size of row and column it has.