Depth-first search in APL
What it is
John Scholes builds a depth-first tree-search operator step by step in a Dyalog APL session. It covers higher-order functions and runs the search on the N-Queens problem.
Why Hacker News recommends it
HN commenters call it a beautiful, brilliant demonstration of APL's expressiveness and a model of clear narration.
- 2 people recommended it
- 3 different months
- 3 strong recommendations
- first 2019, last 2021
What HN commenters said
“Beautiful APL programming demonstration by the late John Scholes.”
geocar, 2019-07 · Strong recommendation · in “Non-English-based programming languages”
“Brilliant step-by-step APL depth-first search narration by John Scholes.”
paliilap, 2019-08 · Strong recommendation · in “J can look like APL or English”
Excerpts from Hacker News comments, linked to the originals. Summaries and labels were written by a language model from those comments.
Topics: apl, depth-first search, higher-order functions, array programming, dyalog
Also recommended by the same people
demoA Sudoku Solver in APLDyalog · 4 HN recommenders · 2015–2022
talkRuby Conf 12 - Y Not- Adventures in Functional Programming by Jim WeirichConfreaks · 17 HN recommenders · 2013–2026
talkThe Soul of Erlang and Elixir • Sasa Juric • GOTO 2019GOTO Conferences · 16 HN recommenders · 2019–2024
talk"Simple Made Easy" - Rich Hickey (2011)Strange Loop Conference · 14 HN recommenders · 2022–2026
talk"Making Impossible States Impossible" by Richard Feldmanelm-conf · 9 HN recommenders · 2017–2026
talkWilliam Byrd on "The Most Beautiful Program Ever Written" [PWL NYC]PapersWeLove · 11 HN recommenders · 2017–2026
talkThe Value of Values with Rich HickeyInfoQ · 10 HN recommenders · 2014–2023
talkWhy Isn't Functional Programming the Norm? – Richard FeldmanMetosin · 12 HN recommenders · 2019–2025