Minimalist Video Games and Open Computer Science Research

William Stafford Parsons creates pick-up-and-play, single-player video games built from scratch and conducts computer science research to create improved fundamental algorithms and data structures.

Games

Contrivity

Spawn into the hostile quantum laboratory and destroy wave after wave of oscillations.

Segmentism

Soar over the desolate quantum dystopia and obliterate fortified oscillations from above.

Research

TBDWSP-Shortest-Path: An Optimal Pathfinding Algorithm With Shortest Path Traversal From Source to Destination Using Both Negative and Positive Distance Weights
TBDWSP-Sort-Stable: An Iterative, Optimal, Portable Sorting Algorithm With Linear Auxiliary Space Complexity Derived From Optimized Merge Sort With Fewer Merging Comparisons
TBDWSP-Hash-Table: A Fast Hash Table With an Upper Limit of 10 Million Ordered or Unordered Byte Array Entries With High Average Load Factors and No Key Rehashes
TBDWSP-Glyph: An Optimal Series of Flexible, Portable Algorithms That Convert and Validate Between UTF-8, UTF-16 and UTF-32 Character Encodings in Segments
November 10th, 2024WSP-Vortex: A Fast, Non-Multiplicative, Tiny 32-Bit PRNG as an Improvement to Mersenne Twister With Better Statistical Test Results and Flexible State Sizes
October 13th, 2024WSP-Hash-64: A Fast, Non-Cryptographic, Non-Multiplicative 64-Bit Hashing Algorithm With Good Statistical Quality and Aligned Multi-Byte Memory Reading
September 12th, 2024WSP-PRNG-16: A Fast, Non-Multiplicative, Tiny 16-Bit PRNG With Good Statistical Quality Among Large Quantities of Small Numbers Generated
August 30th, 2024WSP-TRNG: A Classical TRNG Algorithm With Quantum-Level Entropy Generating Random Numbers From CPU Oscillations and Temporal Precision Theory
August 26th, 2024WSP-Search-Sorted: A Fast Search Algorithm Derived from Optimized Binary Search With Fewer Comparisons To Condense Bounds on Average
August 13th, 2024WSP-Hash-OAAT: A Fast, Lightweight, Non-Multiplicative, One-at-a-Time 32-Bit Hashing Algorithm That Passes Rigorous Collision Tests
August 9th, 2024WSP-Sort-Unstable: A Fast Sequence Calculation Algorithm To Improve Shell Sort Performance Without Auxiliary Memory or Pre-Calculated Increments
August 7th, 2024WSP-Hash-32: A Fast, Non-Cryptographic, Non-Multiplicative 32-Bit Hashing Algorithm With Good Statistical Quality and Aligned Multi-Byte Memory Reading
July 11th, 2024WSP-Navigate: An Optimal Calculation of Diagonal and Orthogonal Navigation Steps in 2-Dimensional Grids With Fewer CPU Cycles on Average
July 10th, 2024WSP-Hash-256: A Cryptographic, Non-Multiplicative 256-Bit Hashing Algorithm Without Input Padding, Parallel Reads or Prime Number Vulnerabilities
July 8th, 2024WSP-PRNG-32: A High-Performance, Low-Resource, Non-Multiplicative 32-Bit PRNG With Good Statistical Quality and a Large Full Cycle