Implementation Minimax Algorithm in Mini Chess Game
Daftar Isi:
- This game is a simple mini game of chess where there are only seven pieces for each color of a horse, a minister, and five pawns. Where the horse is also regarded as the king / hero in this game if the horse dies then the game ends. Horses and ministers are also to protect the pawn berugas because if all the pieces off the game also ends. To rule this game similar to chess in general only slightly different seliain rules of pawn and pawn end game can only walk 1 step when you first walk. Because of this game versus a game and a little sharpen the brain, then this game using the Minimax algorithm, a tree data structure.