工具站 HOTFeaturedAll
Hacker News ShowScore70

Show HN: A geometry puzzle from an Erdős problem, with every optimum proven

Summary

Place points on a grid stretched by √2 so the distances between them repeat as much as possible; every board's optimum has been proven by exhaustive search, and you learn Erdős problem #659 by playing.

Why this matters

Published within 24 hours · Relevant to this topic

Open original ↗

Source: Hacker News Show · dhiraj-niural.github.io

Related items