Threat Matrix: A Fast Algorithm for Human–Machine Chinese Ludo Gaming

• DOI: 10.3390/electronics11111699
• Publication Date: 2022-05-26T12:50:22Z
• Authors: Fuji Han; Man Zhou
• Keywords: Matrix (chemical analysis); Logical matrix; Dice

Chinese Ludo, also known as Aeroplan Chess, has been a very popular board game for several decades. However, there is no mature algorithm existing human–machine gambling. The major challenge the high randomness of dice rolls, where must ensure that machine smarter than human in order to guarantee owner machines makes profit. This paper presents fast Ludo (named “Threat Matrix”) we have recently developed. Unlike from most chess programs, which rely on performance computing machines, evaluation function our program only linear sum four factors. For and low-cost computation, innovatively construct concept threat matrix, by can easily obtain between any two positions. matrix approach greatly reduces required amount calculations, enabling run 32-bit 80 × 86 SCM with 100 MHz CPU while supporting recursive algorithms search plies. Statistics compiled matches against players show an average win rate 92% time limit, 95% limit 10 s, 98% 5 s. Furthermore, reduce computation cost nearly 90% compared real-time computing; memory consumption drops stable, increases speed 58% computing.