This is snippet of code solves the interesting (and specialized) problem of generating all permutations of a list. I hope you like recursion. For exmaple:

permute( [0,1,2] )

would return

[[0,1,2],[0,2,1],[1,0,2],[1,2,0],[2,0,1],[2,1,0]]

Create a regular expression pattern matching any positive number that is less than or equal to the given max number

Example:

pattern = createRegExNumberPattern( 950 )

print pattern

([0-8]\d\d)|(9[0-4]\d)|(950)

A simple CLI hangman implementation in Python.

Uses a simple list of countries in countries.txt to generate words.

A simple anagram solver in python. Requires a dictionary named wordlist.txt

A simple anagram maker written in python. Automatically adds original word to wordlist.txt if it does not exist there already so it may be used in conjunction with the solver.

A simple platformer written in python using pygame. It is still plagued with bugs at the moment. Pre-Alpha.

Part 1 of an autocomplete plugin designed for use in IMs. Not entirely finished since if two new words are used in one string then it doesn't add them correctly - starting with a full wordlist would reduce the chance of this occurring however.

When given the start of a string it searches the wordlist and returns the most popular word used beginning with that string. Designed to be used in autocomplete IM plugin where tab would cycle through used words beginning with the string, in order of popularity.

This module is a Python Library to support all IP2Location™ database products. It has been optimized for speed and memory utilization. Developers can use the API to qeury all IP2Location™ binary databases for applications written in Python.

Python example set-up script from python.org docs.