Please start any new threads on our new
site at https://forums.sqlteam.com. We've got lots of great SQL Server
experts to answer whatever question you can come up with.
| Author |
Topic |
|
rtutus
Aged Yak Warrior
522 Posts |
 Posted - 2006-03-08 : 10:07:38
|
| For this challenge, you'll need to write an algorithm to find your way from one corner of a field to another as fast as possible. You will be given a starting point and an ending point, and you'll need to tell us how long it will take you to get from start to finish. The field is a grid, and you can only move up, down, left and right. Each move of one grid square takes 1 second. Unfortunately, there's also walls in the way. Each wall either runs vertically or horizontally on the field. The walls are of varying height. To climb up a wall that's one meter higher than where you are now (the field is at a height of zero) will ......The rest ll be here:http://www.scm.ca/programmingchallenge/maze.htm |
|
|
jhermiz
3564 Posts |
Posted - 2006-03-08 : 11:48:12
|
This homework ?
Keeping the web experience alive -- [url]http://www.web-impulse.com[/url]RS Blog -- [url]http://weblogs.sqlteam.com/jhermiz[/url] |
 |
|
|
spirit1
Cybernetic Yak Master
11752 Posts |
Posted - 2006-03-08 : 13:54:21
|
i think it's more of a challenge/homework than just homework  Go with the flow & have fun! Else fight the flow  |
|
|
|
Michael Valentine Jones
Yak DBA Kernel (pronounced Colonel)
7020 Posts |
Posted - 2006-03-08 : 14:18:47
|
Extra credit homework?select min(route_travel_time)from All_Possible_Routeswhere Start_Position = @start and End_Position = @end CODO ERGO SUM |
|
|
|
rtutus
Aged Yak Warrior
522 Posts |
Posted - 2006-03-08 : 15:10:34
|
| good atrt, so how to calculate all possible routes thenI ll also think about it, not very easy thoghy, gracias |
|
|
|
|
|
|
little programming challange since u re great guy