Research Article
A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-specific Data Structures
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 54 - Issue 11 |
| Published: September 2012 |
| Authors: Abejide Olu Ade-Ibijola |
10.5120/8612-2469
|
Abejide Olu Ade-Ibijola . A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-specific Data Structures. International Journal of Computer Applications. 54, 11 (September 2012), 24-28. DOI=10.5120/8612-2469
@article{ 10.5120/8612-2469,
author = { Abejide Olu Ade-Ibijola },
title = { A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-specific Data Structures },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 54 },
number = { 11 },
pages = { 24-28 },
doi = { 10.5120/8612-2469 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Abejide Olu Ade-Ibijola
%T A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-specific Data Structures%T
%J International Journal of Computer Applications
%V 54
%N 11
%P 24-28
%R 10.5120/8612-2469
%I Foundation of Computer Science (FCS), NY, USA
Abstract
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-from-scratch" deck of Virtual Cards for the game of Whot! and a satisfactory permutation was achieved.
References
- McLeod John (2007). Whot! Retrieved from http://www. pagat. com/com/whot. html#variations August, 2012.
- Mann Brad (1993). How many Times Should you Shuffle a Deck of Cards? Dartmouth College Chance Project http://www. dartmouth. edu/~chance/teaching_aids/Mann. pdf
- Mvngu (2011). Statistical Analysis of the Fisher-Yates Shuffle. http://mvngu. wordpress. com/2011/05/08/statistical-analysis-of-the-fisher-yates-shuffle/
- Irde (2012). Shuffling an Array. Tutorial 2, inside Data Structures and Algorithms. http://www. lrde. epita. fr/~adl/ens/iitj/eso211/tut2. pdf
- Fisher, R. A. , Yates, F. (1948)
- . Statistical tables for biological, agricultural and medical research (3rd ed. ). London: Oliver & Boyd. pp. 26–27. OCLC 14222135. (note: 6th edition, ISBN 0-02-844720-4, is available on the web, but gives a different shuffling algorithm by C. R. Rao)
- Durstenfeld, Richard (1964). "Algorithm 235: Random permutation". Communications of the ACM 7 (7): 420. doi:10. 1145/364520. 364540.
- Black, Paul E. (2005). "Fisher–Yates shuffle". Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology.
- Atwood Jeff (2007). Danger of Naivete. http://www. codinghorror. com/blog/2007/12/the-danger-of-naivete. html
- Chen Yanguang (2012). Zipf's Law, Hierarchical Structure, and Cards-Shuffling Model for Urban Development. Hindawi Publishing Corporation. Discrete Dynamics in Nature and Society, Volume 2012, Article ID 480196, 21 pages.
- Wiki (2012). Shuffling and Fisher-Yates Shuffle. Wikipedia Online Encyclopedia.
- Wilson, M. C. (2004). "Overview of Sattolo's Algorithm"INRIA Research Report. 5542. Algorithms Seminar 2002–2004. Summary by Éric Fusy. pp. 105–108. ISSN 0249-6399.
Index Terms
Keywords