PLEASEABSTAIN

Difficult tools for easy problems.

The Collection

Case Studies

Real algorithms implemented, improbably, in INTERCAL.

Warnsdorff's Knight's Tour

A complete 8×8 knight's tour, assembled from a hand-built 64-bit arithmetic library — because the standard library's ADD64 never writes its output. It works. This was not required of it. Read the write-up ↗

Hilbert-Curve Geospatial Indexing

Demonstrating that INTERCAL's mingle operator ($) is the standard Morton (Z-order) code, with a Hilbert refinement layered on top. Read the write-up ↗

Stable Marriage

Gale–Shapley, in a language with no if, no loops, and a politeness checker. Proceed at your own risk. Read the write-up ↗