An.lntroduction to Infinite Hat Problems CHRISTOPHER S. HARDIN AND ALAN D. TAYLOR at-coloring puzzles (or hat problems) have b e e n a r o u n d at least sinceGardner 1961), a n d probably longer. They gained wide

First Page		Document Content
Date: 2017-07-13 14:25:01		An.lntroduction to Infinite Hat Problems CHRISTOPHER S. HARDIN AND ALAN D. TAYLOR at-coloring puzzles (or hat problems) have b e e n a r o u n d at least sinceGardner 1961), a n d probably longer. They gained wide Add to Reading List Source URL: www.cs.umd.edu Download Document from Source Website File Size: 1,88 MB Share Document on Facebook