Darts, Checkouts and Recursion
Two methods for calculating the number of ways to checkout from a given score in darts
Two methods for calculating the number of ways to checkout from a given score in darts
Pythagoras’ Theorem, Pythagorean triples and Dijkstra’s generalisation.
How did astronomers calculate the distance to the planets?
How did the ancient Greeks calculate the distance to the Sun? The first post in a series exploring the measurement of distances to various celestial objects.
An overview of Olbers’ paradox and our place in the cosmos.
A brief overview of n-grams and techniques for improved random name generation.
A brief guide to generating random names with Markov chains.
A short article adapted from my award-winning poster presentation at Pawsey.
A discussion of the relatively new Travelling Thief Problem; a merger of the well-known Travelling Salesman and 0-1 knapsack problems, plus a brief foray into computational complexity.