Skip to content

Instantly share code, notes, and snippets.

@DomNomNom

DomNomNom/coins_cover_points.md

Last active May 22, 2020 03:56
Show Gist options
  • Save DomNomNom/1ce0f6a76af68aef51bb655c214b775b to your computer and use it in GitHub Desktop.
Save DomNomNom/1ce0f6a76af68aef51bb655c214b775b to your computer and use it in GitHub Desktop.
Download ZIP
A deceptively hard circle covering puzzle
Raw
coins_cover_points.md

You play a game against Malory, in which you choose points on the 2D plane and Malory wins if she can cover them by using non-overlapping pennies (disks of radius 1). Show a minimal set of points that guarantees you a win.

Hint

At low numbers of dots, Malory is favoured (if there is 1 dot, just cover it with 1 circle), and at high numbers of dots you are favoured (e.g. by using a grid approach like https://www.desmos.com/calculator/gwwcn40xcp)

Here's something that'll let you test out your theories: https://www.desmos.com/calculator/ifhtfwhnqm

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment