Philippine E-Journals

The Enhancement of the Searching Algorithm Employed In Computer-Based DAMATH Game Using Negamax with Alpha-Beta Pruning Algorithm

Jon Henry Javilles | Melchisedec Rentillo

 

Abstract:

This study was done for the purpose of enhancing the searching algorithm of the computer based Damath game using the Negamax with alpha-beta pruning algorithm. The previous searching algorithm is the breadth-first search (BFS) which focuses only on keeping the chip until there is no more movement available and does not focus on finding any other possible moves due to this searching ability, deadlock sometimes occur. The Negamax with alpha-beta pruning algorithm is focused on finding any possible moves until it finds the maximum values. This means that the Negamax with alpha-beta solves the weakness of the previous algorithm and enhances the searching capability of the said game. Aside from enhancing the algorithm, the Damath game has certain features that allow human players to interact in the game mode of Human vs. Intelligent Machine. Unlike the usually played physical Damath, this computerized Damath is unique in gaming style and response. The Negamax with alpha-beta pruning is better than the BFS in terms of response of moves and speed of response. It has a better chance of winning due to its capability of finding the maximum values wherein it calculates all the possible scores and gets the maximum scores out of them.