View Forum Topic

Forums
CS332F
Week 3 problems.

Author	Message
rabbott Posts: 1649	Posted 12:57 Jan 24, 2014 \| Because of the flu, Jeff wasn't at our meeting last Wednesday. He had sent an email with his suggested problem for this week: Paratroopers. (Jeff, Do you have any initial thoughts about how to approach this problem? If so, post them in a reply to this message.) Even though we've decided to stay with last week's problems, let's add Jeff's new problem, which looks both interesting and different from others we've tackled. Here are this week's problems. A Knight's Journey (See Wolfram MathWorld Knight's Graph, and "Knight's tour algorithm") Alphacode Dictionary Georgia and Bob Paratroopers Last edited by rabbott at 12:58 Jan 24, 2014.
jkiyomu Posts: 27	Posted 08:32 Jan 27, 2014 \| Sorry, I was busy this weekend I didn't notice this until now. The way I thought about doing this problem was to make a corrdinate point for all the paratroopers and whether they are on the same path (x, y) then find all the solutions and take the one with the smallest value.

Author

Message

rabbott

Posts: 1649

Posted 12:57 Jan 24, 2014 |

Because of the flu, Jeff wasn't at our meeting last Wednesday. He had sent an email with his suggested problem for this week: Paratroopers. (Jeff, Do you have any initial thoughts about how to approach this problem? If so, post them in a reply to this message.) Even though we've decided to stay with last week's problems, let's add Jeff's new problem, which looks both interesting and different from others we've tackled. Here are this week's problems.

A Knight's Journey (See Wolfram MathWorld Knight's Graph, and "Knight's tour algorithm")
Alphacode
Dictionary
Georgia and Bob
Paratroopers

Last edited by rabbott at 12:58 Jan 24, 2014.

jkiyomu

Posts: 27

Posted 08:32 Jan 27, 2014 |

Sorry, I was busy this weekend I didn't notice this until now.

The way I thought about doing this problem was to make a corrdinate point for all the paratroopers and whether they are on the same path (x, y) then find all the solutions and take the one with the smallest value.