Data Management

A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-Specific Data Structures

Download Now Free registration required

Executive Summary

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.

  • Format: PDF
  • Size: 808.51 KB