A Peg Solitaire Font

Year: 2017 Authors: Taishi Oikawa; Kazuaki Yamazaki; Tomoko Taniguchi; Ryuhei Uehara

Core claim

A supercomputer can enumerate enough peg-solitaire states to construct a playable 5×7 font of reachable characters.

Topics

algorithmic typography, peg solitaire, reachable patterns, animated GIFs

Domains

computational complexity, graph search, Hamming distance, combinatorial enumeration, type design, algorithmic art, puzzle fonts, visual communication

Methods

exhaustive enumeration, binary-state encoding, heuristic character selection, backtracking reconstruction

Media

5×7 peg solitaire board, GIF animation, binary arrays

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.