First post here. Tried to get the most minimalistic way to calculate the amount of permutations. The typical formula is:

n! = 1 * 2 * 3 ... * r * r + 1 * ... n
r! = 1 * 2 * 3 ... * r

But since every number between 1 and r is simplified, it's just a multiplication of the (x)range between r+1 and n.

Also as an example of lambda functions on python, and the reduce function, which takes every pair inside a list-type object and runs the function over them.

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.

Recursively removes files or directories with a given name, using find.

I most frequently use it to remove 'CVS' or '.svn' directories from sourcepackages that still have the versioning information in them.

Reads a file line by line using Python in 3 lines