Home | Blog | Software | Reviews and Features | Forum | Help | Donate | About us

avatar image

Welcome, Guest. Please login or register.
Did you miss your activation email?

Login with username, password and session length
  • October 10, 2015, 01:07:33 PM
  • Proudly celebrating 10 years online.
  • Donate now to become a lifetime supporting member of the site and get a non-expiring license key for all of our programs.
  • donate

Author Topic: IDEA: efficient algorithm for Snakes and Ladders  (Read 4846 times)


  • Participant
  • Joined in 2006
  • *
  • Posts: 1
    • View Profile
    • Donate to Member
IDEA: efficient algorithm for Snakes and Ladders
« on: October 02, 2006, 09:09:29 AM »

Here at work we have been having a coding competition for bragging rights.
The idea is to find the fastest and most efficient algorithm for solving a snakes and ladders board.
The rules are to start off the board and ends when you land exactly on the last square.
I have been trying in C# and am having no luck.  :-[

Any takers?  :D

« Last Edit: October 02, 2006, 09:48:55 AM by brotherS »