For a demo project, I want to create a hashing function with a very high probability of collision. Something simple is fine since the aim of the project is NOT security - but to demonstrate hash collisions. 

Can anyone help me get started with an algorithm, or a sample implementation, or just point me in the right direction?

I am doing this in Python, though maybe that should not matter.