See the latest video in Dyalog's Library ...

[Karen|Dyalog]

The latest video in Dyalog’s library – Depth-First Tree-Search in APL – is now available https://www.youtube.com/watch?v=DsZdfnlh_d0

The classic depth-first search algorithm is explored using APL, a simple and concise array notation with high-order functions. The presentation highlights APL's incremental development style, using simple steps and culminating in a purely functional solution for the N-Queens problem. The informative style of this presentation brings clarity to this advanced topic, making it accessible even to those who are still near the start of their APL journey.

Once you’ve seen the video, why not examine the code used in greater detail and try the expressions for yourself in the online tutorial at http://tryapl.org/ (Learn tab > Depth-first search)

For more on depth-first search in APL, see http://dfns.dyalog.com/n_trav.htm
For more on the N-Queens problem, see http://dfns.dyalog.com/n_queens.htm