HackerTube.dev

Anagrams, but where you can break apart letters: "Anagraphs"

suckerpinch · 255.9K views · 2017-12-18 · 12:04

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

Tom Scott-style exploration by suckerpinch (Tom7) of generalized anagrams where letters can be broken into pieces, called anagraphs, with a whimsical computational approach.

On Hacker News

HN recommends it as a typical example of Tom7's technically astounding and playful videos.

Recommended by 3 HN people across 3 months · HN mentions 2020–2023

Topics

Search by tags

What people said

_jholland · 2023-05 · Strong recommendation

This is great! It reminds me of a Tom7 video of a similar ilk: Anagrams, but where you can break apart letters: "Anagraphs" - [VIDEO] . Similar to this, he produces a standard form for each word, but breaks each letter into letter pieces or 'atoms' which gives much more freedom for moving between words. Definitely give it a watch. If you are not familiar with Tom7's videos, he has a hilarious whimsical style while also bringing to life completely out there ideas with some brilliant technical skill.

Read the original HN comment ↗
ryanfox · 2020-10 · Strong recommendation

> I want fonts to be made out of just a handful (at a minimum) of primitives -- e.g. here's a vertical stroke, a horizontal stroke, diagonal strokes, what various serif endings look like, here are what the bowls of letters look like, etc. Tom7, who makes excellent videos about computers, has one about splitting letters up to create anagrams in this way.[0] All of his videos are technically astounding, like the one where he frankensteined a raspberry pi into a game cartridge to play SNES games on a NES, or the one where he designed and built a computer using IEEE 754 NaN and infinity instead of 0 and 1. [0] [VIDEO]

Read the original HN comment ↗
xmprt · 2021-04 · Recommendation

His video on anagraphs is interesting ( [VIDEO] ) especially if watched alongside his followup video proving that generalized kerning is an undecidable problem ( [LINK] )

Read the original HN comment ↗

Sources

Video by suckerpinch, played through YouTube.

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks
  • SaaS & AI candidates: Topic keywords do not match
  • Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources