Yesterday’s post on taxation generated a whole lot of comments that deserve responses; unfortunately I’m too swamped right now to respond. Worse yet, I’ll be out of town — and probably not blogging — for the next few days. Sometime next week, I’ll try to craft a new blogpost addressing much of what was said in those comments.
Meanwhile, here, courtesy of our frequent and invariably interesting commenter Mike H, is a puzzle to keep you busy while I’m gone:
Your enemy places, say, 8 red points and 8 blue points in the plane. Your job is to connect each red point to some blue point with a straight line segment, so that none of the line segments cross.
1) Can your enemy place the points in such a way that you are guaranteed to fail?
2) What if we make your job harder by requiring each blue point to be used exactly once?
3) What if we change 8 to 17 or 26 or 43 or …. ?
Edited to add: Question 2) is the interesting one. Also, to keep it interesting, your enemy is not allowed to put any three points on the same line.