Abstract—1010! is a tile-matching game for Android and iOS. Players aim to fill a board’s entire row or column using blocks from block holder to empty the board, thus create more space for the next blocks. These blocks are randomly-generated, thus occasionally block holders will hold blocks that cannot fit into the board by any combination and cause the game to end. This loss can be avoided using a two-stage performance improver consists of validator and unfit block changer. Validation begins by creating an AND-OR tree as a basis for validation’s flow, taking block set’s permutation and block’s position to the board into account. If the block set is deemed unfit, block changer algorithm will calculate the heuristics for each block based on frequency and location of failure in the validation stage, then change the block with the highest heuristic with random block and redo the validation stage with new block set. After measuring performance on five gameplays, running only the validation stage results in an average of 3.95 ms, while doing both stages ran in 14.48 ms on average.
Index Terms—AND-OR tree, mobile game, random generator, tile-matching.
Livia A. Lohanda, Samuel Lukas, and Irene A. Lazarusli are with the Informatics Department, Universitas Pelita Harapan, Tangerang, Indonesia (e-mail: livia.lohanda@uph.edu, samuel.lukas@uph.edu, irene.lazarusli@uph.edu).
[PDF]
Cite:Livia Andriana Lohanda, Samuel Lukas, and Irene Astuti Lazarusli, "Performance Improver for Block Generator in 1010! Using AND-OR Tree," International Journal of Computer Theory and Engineering vol. 11, no. 6, pp. 116-119, 2019.
