Subject:
|
Re: I think we shoudl try this sometime...
|
Newsgroups:
|
lugnet.org.ca.rtltoronto
|
Date:
|
Tue, 27 Sep 2005 21:45:27 GMT
|
Viewed:
|
630 times
|
| |
|
|
David Koudys wrote:
> and check out that maze thing--it's line following but your 'bot has to learn
> each time it goes thru the maze--which branches not to take, or which branches
> to take. We could see how many times it takes a 'bot to go thru the maze and
> 'learn the course'--the fewest times to learn the maze wins the competition.
I don't get why you wouldn't know it perfectly the second time through?
Derek
|
|
Message has 1 Reply:
 | | Re: I think we shoudl try this sometime...
|
| (...) Well, there's a couple of ways you could do it. You could say that no single attempt can take longer than n+10 seconds (or something), where n is the number of seconds the robot could make the run in by the shortest path. That way, it will (...) (19 years ago, 27-Sep-05, to lugnet.org.ca.rtltoronto)
|
Message is in Reply To:
| | I think we shoudl try this sometime...
|
| Along with great suggestions from Greg... I have one, taken from this post-- (URL) its a Hassenplug plug ;) ) find the video on this page-- (URL) check out that maze thing--it's line following but your 'bot has to learn each time it goes thru the (...) (19 years ago, 27-Sep-05, to lugnet.org.ca.rtltoronto)
|
6 Messages in This Thread:
  
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
