Darts, Checkouts and Recursion
Two methods for calculating the number of ways to checkout from a given score in darts
Diamond-Square
Generating fractal terrain with the diamond-square algorithm.
Improved Name Generation
A brief overview of n-grams and techniques for improved random name generation.
Procedural Name Generation
A brief guide to generating random names with Markov chains.
Detecting Craters on Mars
A short article adapted from my award-winning poster presentation at Pawsey.
The Travelling Thief Problem
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.
SHPC: Parallelism Basics
This final SHPC post briefly covers the basics of OpenMP and MPI.
SHPC: Complex Networks
A brief overview of some of the major graph models in the field of complex networks.
SHPC: Optimisation
A brief overview of some methods for mathematical optimisation.
SHPC: Schrödinger
We explore three methods of solving the Schrödinger equation for the purpose of estimating the energy eigenvalues.
SHPC: Numerical Methods
A discussion of numerical methods to solve ODEs (Euler, Runge-Kutta), as well as root finding with the Bisection Method.
SHPC: Fortran
A brief introduction to the fundamentals of Fortran.