Simulating Dice and Coin Flips
This is going to be a rather short article because its a pretty simple concept, though one that comes up repeatedly on various programming forums: How to you simulate a coin toss or the roll of a dice?
First In, First Out
Queues are on of the most fundamental data structures in use. Queues are an ordered collection. Items are added in such a way that the first item added to the queue is the first Item to be removed. They pop everywhere
Using the algorithmic technique of backtracking to solve the famous N Queens chess puzzle.
Detecting a Cycle in a Linked Lists
I was asked for a solution to this question on quora in the C programming section, and since i put a detailed answer there, i figured i would post my solutions here as well to reach a broader audience.
Where we left off...
When we last left off we had the basics of our game engine in and character classes in place. In this section we will be covering basic Procedural Dungeon Generation.
-
Procedural Map Generation with Binary Space Partitioning
-
Exact Match String Searching: The Knuth-Morris-Pratt Algorithm
-
The visitor pattern: OOP takes on the Expression Problem
-
Improving mgcLisp's define syntax
-
Separating the Men from the Boys, Knuth Style
-
Reducing rotations during deletion from AVL trees
-
Parsing Lisp: From Data To Code
-
Swiz Heaps: A deterministic modification of Randomized Meldable Heaps
-
Let's talk Eval/Apply
-
BST Deletion: Removal By Merge