Application of the Fisher-Yates Shuffle Algorithm in the Game Matching the World Monument Picture

Abstract

The application of the concept of artificial intelligence is very helpful in various randomization problems. One example of the application of artificial intelligence to the problem of randomization is in the game of matching images of world monuments. In the game matching world monument images, a randomized picture sequence will appear, and then the player will click on the image to open the image, and then click on another image for the same or matching image. The picture order for the new game will be randomized, so the image order display will not be the same as the previous image order display. In this study, the process of randomizing this game using randomization algorithms that exist in the science of artificial intelligence is the Fisher-Yates Shuffle algorithm. Shuffling algorithm Fisher-Yates Shuffle can randomize the order of data entered into the array because this algorithm is biased or it is unlikely to appear in the same order. This game matching application of world monuments can support learning in honing children's memory skills. This game consists of 3 levels. At the easy level, there are 16 boxes containing 8 pairs of images, at the moderate level there are 20 boxes containing 10 pairs of images, while at the difficult level contains 24 boxes containing 12 pairs of images that must be matched.