Anarchy
| Autor: | Peter Mawhorter |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Theoretical computer science
Initial Seed Computational creativity Shuffling Basis (linear algebra) Computer science Process (engineering) 05 social sciences Chaotic 050801 communication & media studies 020207 software engineering 02 engineering and technology CHAOS (operating system) 0508 media and communications 0202 electrical engineering electronic engineering information engineering Generative process |
| Zdroj: | FDG |
| DOI: | 10.1145/3337722.3341851 |
| Popis: | Pseudo-random number generators are ubiquitous components of content generation systems, because their outputs are difficult to predict but also repeatable given an initial seed. These properties make them especially useful as the basis for "random" decisions during a generative process, as they allow the process to be chaotic but also repeatable. This paper describes an open-source family of pseudo-random algorithms which allow for shuffling and distributing items in a reversible and incremental manner. To demonstrate the applicability of these algorithms, I show how they have been used in the creation of a word-search game which includes strong guarantees about the distribution of words that can be discovered. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|