input values x, y, output positions, calculate...

[zeljc]

here is the idea: bank A and bank B
| |input # of rocks |_|, or not (check box)
| | x, y coordinates (if input)
| | x: |_|, y: |_| |submit every rock|
A| | B
| |
| |
| | |draw and calculate|
| |

input how many rocks you want into input field, or check the check box and it does a random input.
|submit every rock|: it draws a rock onto stage(just puts the picture of a rock onto stage). so it looks something like this(10 rocks is just for example):

| 1 |input # of rocks |_|, or not (check box)
| 2 | x, y coordinates (if input)
| 3 4 | x: |_|, y: |_| |submit every rock|
A| | B
| 5 6 |
| |
| 7 | |draw and calculate|
| 8 9 10 |

|draw and calcutale| button does: draws lines between bank A and bank B, where the lines length is the shortest distance, where one can step on a rock. for example:

A -> 2 is the first step because it's the shortest. next would be 2 -> 3, because it's the shortest.if the distance between 2 and 3 is greater then A and 2, then our new distance(step) is 2-3.(so i can still get from A to 2). next would be 3 - > 5. now this is our longest step. now i can get to 6. because the distance from 5 - > 6 is greater then 6 -> B, i can get to B. but 5 -> 6 lenght can be used maybe to do next(and get even shorter trip): A -> 8, 8 -> 7, 7 -> B. so i need 3 steps to cross it. and if that is the shortest way(in steps and distance) then it draws that one.

maybe a bit confusing but help.

 

[kennethkawamoto]

Do you need to use up all the rocks? If not, the shortest distance is the straight line passes one rock.

Kenneth Kawamoto

http://www.materiaprima.co.uk