"There are four ranks of cards, instead of the usual 13. Instead of 2 through Ace, cards are ranked according to the topological classification of their symbol ... 2,3,5,7,J,K all have the same property that they can be deformed into a dot or line. These are the lowest ranked cards. In fact, by themselves they're worth dick--hence the name for these cards.

4,6,9,A are topologically the same as a 'o', and hence are called holes, ohs, or--if you can get away with it--hoes. These are the second ranked cards in ascending order.

10 is in a class by itself because it's a combination of a dick and a hoe, so it's called a Split, and is third ranked.

8,Q are topologically the same because of the way the Q is made on cards, with the slash going all the way across and creating two holes. This is the highest rank--the double hoe, or just double."

Suppose there are "m" doctors and "n" patients (with "n<=m"). There are "mn" combination's of examinations that pair doctors/patients. How many surgical gloves are needed so that no doctor wears a glove contaminated by a patient, and no patient is exposed to a glove worn by another doctor?

• - build tower as tall as possible
• - blocks swing at top and you click mouse to drop them
• - block will fall after you click and it MUST land on top of the block that you dropped previously (otherwise you lose a "life" - you have 3 "lives")
• - if you drop PERFECTLY on top, you get bonus points
• - as the tower gets bigger, it starts to shake back and forth making it harder to drop the blocks on top

The impossible (yet so simple) dice game.

Play the game:

Instructions:

• Press the "Roll dice!" button to start.
• Try and determine how many moves there are until checkmate.
• Press the "Display Answer!" button to see if you are right.
• Once you have figured it out, don't spoil the fun for others!

Background:

Play the game here:

Instructions:

• Press the "Roll dice!" button to start.
• Try and determine how many petals are around the rose.
• Press the "Display Answer!" button to see if you are right.
• Once you have figured it out, don't spoil the fun for others!

• The oldest pirate proposes how to share the coins, and all pirates remaining will vote for or against it.
• If 50% or more of the pirates vote for it, then the coins will be shared that way. Otherwise, the pirate proposing the scheme will be thrown overboard, and the process is repeated with the pirates that remain.