{'fraction_non_alphanumeric': 0.02155576382380506, 'fraction_numerical': 0.0, 'mean_word_length': 5.319526627218935, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-specific Data Structures

Generally stated Algorithms are often preferred because of their wider horizon of applications owing to their freedom from any underlying language specification – they 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 concern – such 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.