Lay one domino down flat. Then, stick two dominos packed together on the very end of the one that’s laying down flat. Next, take three dominoes packed together and put them next to the end of the flat one that has the two on it, but put the three perpenducular to the two. When the two dominos packed together are hit, they won’t be able to push through the three. But, if the three were first knock out of the way from the side, then when the two are hit they can topple over and hit the ouput chain.

John: Do you want the list for programming with, or for looking at? And how is sorting it according to java hashcode not useful? :-) Actually, you’ve made me want to publish a dictionary where the words are on the page of their hashcode according to a simple human computable method. I ran a couple of tests with features humans could easily spot (number of descenders, number of vowels, etc) and then modding it by the intended number of pages (500 seems reasonable), but I’m still not down to a reasonable maximum number of words per page. If anyone can help me, we can share the enormous profits from the publishing (lulu).

Fantastic, a dictionary you can only use if you already know how to spell the word and can do mental arithmetic. Could make it even more evil if you included aspects of the meaning into the hash code, then you could only use it if you know what the word means and how to spell it. You know it’d be a hit with elitist geeks.