Static Chess

Original Article ↗ Hacker News Discussion ↗

Overall concept & reactions

  • Many commenters like the minimalist, link‑driven, no‑JS chess and its “brutalist” aesthetic.
  • Others see it mainly as a clever demo or experiment rather than a practical way to play.
  • Some are disappointed it’s not “fully static” in the sense of pre‑rendering all positions.

Implementation details & “static” debate

  • The app encodes board state in the URL and returns pure HTML/CSS per move; every move is a link.
  • Debate over whether this counts as “static”: some say yes (no XHR/JS needed), others note pages are still dynamically rendered on request.
  • One suggestion: hybrid approach where frequently visited positions are pre‑rendered and others generated on demand.

URLs, FEN, and move encoding

  • It uses FEN to represent positions. Several argue this is correct because identical positions share identical URLs.
  • Others suggest also encoding move history (e.g., as URL fragment) to support repetition rules and better searching.
  • Discussion about maximum URL length and compressing move sequences; consensus that modern browsers can handle real games.

Rules coverage and engine completeness

  • Valid move legality is enforced, including not moving into check.
  • Gaps noted: no explicit checkmate display, limited or unclear en passant handling, and auto‑promotion only to queen.
  • Some argue full draw detection (threefold/fivefold repetition) requires history beyond FEN; others note FEN’s half‑move counter already supports the 50/75‑move rule.

Variants & illegal positions

  • The system can start from arbitrary FEN, enabling Chess960 and custom setups.
  • Discussion on Chess960 castling rules and how FEN must encode which rook can castle.
  • The app happily serves wildly illegal positions; commenters play with extreme queen‑filled positions.

Performance, UX, and accessibility

  • Mobile Safari had click‑target bugs; some note only edges of squares were clickable, later partially fixed.
  • Critiques include lag due to full page reloads, no drag‑and‑drop, no timers, and awkwardness in some browsers (e.g., Emacs EWW, back‑button issues).
  • Others defend the tradeoff as intentional minimalism.

Indexing, crawling, and combinatorics

  • Commenters joke about Google “computing all chess” by indexing the site.
  • Discussion of crawler heuristics, crawl budgets, and the impossibility of covering all ~10^44 legal positions.