A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-specific Data Structures
Abejide Ade-Ibijola · International Journal of Computer Applications · 2012
Generally stated Algorithms are often preferred because of their wider horizon of applications owing to their freedom from any underlying language specificationthey are not tied to any language and are easily implemented by anybody on any machine.This advantage becomes a hitch in applications where optimal implementation is of paramount concernsuch as in games, as the developer's chosen language might suggest a better implementation that alters the algorithm using predefined data structures and/or sometimes, libraries of the preferred language.In this paper, a reconsideration of the Fisher-Yates Shuffle Algorithm was carried out using the "Generic List" data structure of the .Net library, an enhanced version of the Algorithm was drawn that targets a .Net implementation, a graphical simulation was developed using a "built-fromscratch" deck of Virtual Cards for the game of Whot! and a satisfactory permutation was achieved.