Depth-first search in APL

Name: Depth-first search in APL
Description: 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.

Dyalog

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.

HN commenters call it a beautiful, brilliant demonstration of APL's expressiveness and a model of clear narration.

5 Hacker News mentions · 2019–2021

Topics

Functional programming
Algorithms & data structures

Watch on YouTube

Explore more videos