185 citations · 371 across the 28 of their papers we have counts for
1 paper · 1 filter
Donald E. Knuth
The author presents two tricks to accelerate depth-first search algorithms for a class of combinatorial puzzle problems, such as tiling a tray by a fixed set of polyominoes. The fi…