Weekend Programming Challenge – Issue #35 Maze



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.

The rules:

You can code the solution in any programming language during the weekend and have to submit it to info@olimex.com 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.

5 Comments (+add yours?)

  1. Dylan
    Dec 02, 2013 @ 12:30:08

    So how many people solved NP-complete http://en.wikipedia.org/wiki/Hamiltonian_path ?


    • Sergey
      Dec 02, 2013 @ 23:20:59

      Yeah. A fast solution to this challenge is tricky. I wonder if somebody have implemented it.


    • Marc
      Dec 03, 2013 @ 22:23:25

      My naive solution in C would probably run until the universe reaches thermodynamic equilibrium.

      However, after tinkering a bit with Sage, I found that it can find a solution in a fraction of a second. So, some efficient algorithm must exist.


  2. Monday
    Dec 02, 2013 @ 14:56:49

    I could not find the Cyber Monday 90% off everything landing page to your web shop. Please provide a link to it! 🙂


  3. Patrick
    Dec 04, 2013 @ 05:16:57

    It seems you’re planning an open source pcb routing software? 😉


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: