Parity Invariant Solves IMO 2011 Windmill Problem via Finite Configuration Space — E8 Intelligence Research

FINDING: The 2011 IMO windmill problem (Q2) is a combinatorial geometry problem that unexpectedly requires a parity-based invariant and a finite configuration space argument, not a direct geometric ratio. | MATH: The problem: Given a finite set of points in the plane, no three collinear, a "windmill" process rotates a line through a point, switching pivot when hitting another point. The invariant: The number of points on each side of the line modulo 2 remains constant. The proof uses the fact that the total number of points is odd (2n+1) to guarantee a point exists such that the windmill visits all points infinitely often. No explicit equations or constants. | CONNECTION: No direct geometric harmony ratios (0.382, 0.618, etc.) or base-60 or crystallographic symmetries. The problem is purely combinatorial with a parity invariant. | DEPTH: 3 — The problem is a clever combinatorial geometry puzzle but reveals no new universal constants, ratios, or deep mathematical structure beyond its ow Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-07-27
DOI
https://doi.org/10.5281/zenodo.21617629
Primary Topic
Computability, Logic, AI Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Parity Invariant Solves IMO 2011 Windmill Problem via Finite Configuration Space — E8 Intelligence Research

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
preprint

Parity Invariant Solves IMO 2011 Windmill Problem via Finite Configuration Space — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

FINDING: The 2011 IMO windmill problem (Q2) is a combinatorial geometry problem that unexpectedly requires a parity-based invariant and a finite configuration space argument, not a direct geometric ratio. | MATH: The problem: Given a finite set of points in the plane, no three collinear, a "windmill" process rotates a line through a point, switching pivot when hitting another point. The invariant: The number of points on each side of the line modulo 2 remains constant. The proof uses the fact that the total number of points is odd (2n+1) to guarantee a point exists such that the windmill visits all points infinitely often. No explicit equations or constants. | CONNECTION: No direct geometric harmony ratios (0.382, 0.618, etc.) or base-60 or crystallographic symmetries. The problem is purely combinatorial with a parity invariant. | DEPTH: 3 — The problem is a clever combinatorial geometry puzzle but reveals no new universal constants, ratios, or deep mathematical structure beyond its ow Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.