IDEA: efficient algorithm for Snakes and Ladders -
HOME | Blog | Software | Reviews and Features | Forum | Help | Donate
Click here to
donate and join now!
Welcome Guest.   Make a donation to an author on the site April 19, 2015, 04:26:35 AM  *

Please login or register.
Or did you miss your validation email?

Login with username and password (forgot your password?)
Why not become a lifetime supporting member of the site with a one-time donation of any amount? Your donation entitles you to a ton of additional benefits, including access to exclusive discounts and downloads, the ability to enter monthly free software drawings, and a single non-expiring license key for all of our programs.

You must sign up here before you can post and access some areas of the site. Registration is totally free and confidential.
The N.A.N.Y. Challenge 2015! Download dozens of custom programs!
   Forum Home   Thread Marks Chat! Downloads Search Login Register  
Pages: [1]   Go Down
  Reply  |  New Topic  |  Print  
Author Topic: IDEA: efficient algorithm for Snakes and Ladders  (Read 4673 times)
Posts: 1

View Profile Give some DonationCredits to this forum member
« 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.  embarassed

Any takers?  cheesy

« Last Edit: October 02, 2006, 09:48:55 AM by brotherS » Logged
Pages: [1]   Go Up
  Reply  |  New Topic  |  Print  
Jump to:  
   Forum Home   Thread Marks Chat! Downloads Search Login Register | About Us Forum | Powered by SMF
[ Page time: 0.026s | Server load: 0.08 ]

Share on Facebook
submit to reddit