[net.math] Dot Town, U.S.A. **SPOILER**

halle1@houxz.UUCP (J.HALLE) (08/30/84)

Given all the proposed clarifications, and correcting my earlier posting,
the answer is:

If there are "n" blue dots, on the (n-1)th evening afterwards, all blues
will commit suicide.  On the next night, all the reds will commit suicide.
So the stranger will still buy all the land.

Explanation:  If only one blue dot, that person will see only red, so will
know his is blue.

If two blues, each blue will see only one blue.  When that person does not
commit suicide, then that person will know his own dot is blue.

If three blues, each blue will see only two blues.  When two days later
they are still alive, each of the three knows his own color.

This reasoning follows for "n" days.

Once all the blues are gone, each red knows his own color, so commits suicide.