Maze with 10×10 cells have obstracles placed on random cells marked with the black. Make code which finds path which starts from cell (1,1) and moves through all Maze cells and returns back to cell(1,1) without stepping on same cell more than once.
You can code the solution in any programming language during the weekend and have to submit it to firstname.lastname@example.org latest on Sunday December 1st.
On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC
You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.