{
  "abstract": "Place a queen in each successive column of an infinite $\\mathbb{N}\\times\\mathbb{N}$ chessboard, always choosing the lowest row such that no two queens may attack one another. We prove that the row $q_n$ occupied by the queen in the $n$th column satisfies $q_n=nϕ+O(1)$ or $q_n=n/ϕ+O(1)$, where $ϕ=(1+\\sqrt5)/2$ is the golden ratio.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.31336",
  "author_total": 1,
  "authors": [
    {
      "name": "Boon Suan Ho"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/94w89gq6fnxqw.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.31336",
  "fulltext_url": null,
  "id": "94w89gq6fnxqw",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.31336",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "2607|Advanced Combinatorial Mathematics"
    ]
  ],
  "openalex": "W7214623310",
  "pdf_url": "https://arxiv.org/pdf/2609.31336",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-05",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/94w89gq6fnxqw.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:10Z",
      "native_id": "2609.31336",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.31336"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Greedy queens and the golden ratio",
  "title_text": "Greedy queens and the golden ratio",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:10Z",
  "url": "https://research.draconitic.com/paper/94w89gq6fnxqw",
  "venue": "arXiv",
  "versions": []
}