IMPLEMENTASI ALGORITMA FISHER YATES SHUFFLE UNTUK PENGACAK POSISI NON PLAYABLE CHARACTER PADA PERMAINAN FEEDING FRENZY
Daftar Isi:
- The pattern of the position of the Non Playable Character (NPC) presence in the game arcade is often easily known by the player, so it takes a randomization of the position in the game. Fisher Yates Shuffle is one of the algorithms to overcome randomization problems, where none of the same data generated in each randomization and complexity of this algorithm is O (n). This study uses the Fisher Yates Shuffle as a scrambler for the position of the NPC in a game that resembles a Feeding Frenzy. The test was carried out based on comparison between randomization. These comparisons get an average percentage of 91.3%. The factor that causes the sequence to be similar in comparison depends on the results of the sequence taken randomly on the algorithm. Based on the results of the tests that have been carried out it can be concluded that, the Fisher Yates Shuffle algorithm successfully scrambles the position of the NPC in a game resembling a Feeding Frenzy.