Archive for January, 2010

MooTools 1.2 Beginner’s Guide

I use javascript on a daily basis at work, and MooTools is my framework of choice. It’s easy to use, powerful, and has made my life exceedingly easier. MooTools did much of the heavy lifting in my Google Summer of Code project; I would have spent many more sleepless days without it. [...]

Dijkstra’s Algorithm – Shortest Path

This post will cover the basics of Dijksta’s shortest path algorithm and how it can apply to path finding for game development. It is my opinion that understanding this algorithm will aid in understanding more complex AI algorithms, such as A*. This post is aimed more towards developers starting out in game development or those curious about Dijkstra’s algorithm, but this will be a somewhat simplification of it and discuss mainly the concepts.

Removing ^M characters on ubuntu in vim

Remove ^M characters in VIM by replacing \r with nothing. ^M is really \r. Use :%s/\r//g

Subscribe to RSS Feed My tweets