C++ & Java implementations of 6 algorithm problems — tromino tiling, knight's tour, Tower of Hanoi (4-peg), knight swap, target shooting, and lattice coverage — using Divide & Conquer, Greedy, BFS, ...
Note: Some of the code here is old and was written when I was learning C++. It might be possible that code is not safe or making wrong assumptions. Please use with caution. Pull requests are always ...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results