Tag: DFS

Frog Leap Puzzle with Depth-First Search (DFS)

TL;DR: We solve the classic “frog leap” puzzle with Depth-First Search (DFS) by generating next boards around teh blank and trying jumps before steps. This trick finds the minimal soluton in exactly N^2+2N moves. The classic frog puzzle looks like

Tagged with: , , , , ,

VBA – Depth-First-Search Algorithm with VBA

Depth first search algorithm is one of the two famous algorithms in graphs. I am now in “Algorithm Wave” as far as I am watching some videos from SoftUni Algorithm courses. In the current article I will show how to

Tagged with: , , ,
Top