472,378 Members | 1,580 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 472,378 software developers and data experts.

Mars Rescue Mission Challenge

8 1615

"Frank Buss" <fb@frank-buss.de> wrote in message
news:cn**********@newsreader2.netcologne.de...
A new challenge:

http://www.frank-buss.de/marsrescue/index.html

Have fun! Now you can win real prices.

--
Frank Bu_, fb@frank-buss.de
http://www.frank-buss.de, http://www.it4-systems.de


Would those be retail prices or wholesale prices?

Oh, never mind. It's off-topic here.
Jul 22 '05 #2
"Howard" <al*****@hotmail.com> wrote:

"Frank Buss" <fb@frank-buss.de> wrote in message
news:cn**********@newsreader2.netcologne.de...
A new challenge:

http://www.frank-buss.de/marsrescue/index.html

Have fun! Now you can win real prices.

Would those be retail prices or wholesale prices?


you are right, I meant prize, not price :-)

--
Frank Buß, fb@frank-buss.de
http://www.frank-buss.de, http://www.it4-systems.de
Jul 22 '05 #3
Frank Buss wrote:
A new challenge:

http://www.frank-buss.de/marsrescue/index.html


I don't quite understand this sentence, perhaps I'm not thinking
straight: "If a stone is hit, the speed vectors are devided by 2
(integer devision without fraction) as long as no stone is hit (which
can result in a speed vector of (0, 0))."

So, suppose when step 20 occurs:
* You're 2 pixels left of a stone.
* Your velocity-x will be 2 pixels/step on step 20 and (if possible)
21.
* velocity-y will be arbitrary.
What happens? Are you able to go partly through a stone?
MfG,
Tayssir

Jul 22 '05 #4
Frank Buss wrote:
A new challenge:

http://www.frank-buss.de/marsrescue/index.html

Have fun! Now you can win real prices.


Terribly similar to ICFP 2003. No 1 or 3-day time constraint. What's the fun
in that?
Jul 22 '05 #5
"Tayssir John Gabbour" <ta*********@yahoo.com> wrote:
I don't quite understand this sentence, perhaps I'm not thinking
straight: "If a stone is hit, the speed vectors are devided by 2
(integer devision without fraction) as long as no stone is hit (which
can result in a speed vector of (0, 0))."
the sentence before is important:

| After this the speed vector is added to the coordinate, but only, if
| the new coordinate does not hit a stone after adding the speed.
So, suppose when step 20 occurs:
* You're 2 pixels left of a stone.
* Your velocity-x will be 2 pixels/step on step 20 and (if possible)
21.
* velocity-y will be arbitrary.
What happens? Are you able to go partly through a stone?


no, the robot is always stone-free. If you are 2 pixels left of a stone
and your velocity-x is 2, the next turn you are 0 pixels left of a stone.
Then adding the velocity will result in hitting a stone, so the new
velocity is (1, velocity-y/2) and because this will result in a hit, too,
again the velocity is devided, which will result in a velocity-x of 0 and
velocity-y devided by 2 again.

--
Frank Buß, fb@frank-buss.de
http://www.frank-buss.de, http://www.it4-systems.de
Jul 22 '05 #6
Neo-LISPer <ne********@yahoo.com> wrote:
Terribly similar to ICFP 2003. No 1 or 3-day time constraint. What's
the fun in that?


I know this challenge (to the other readers: you can see it at
http://www.dtek.chalmers.se/groups/icfpcontest/ ) and I liked the idea,
this is one of the reason for this challenge. There might be many people
who don't know the ICFP challenge, and I hope they'll have fun with it.

One difference in my challenge is that you don't need to simulate fixed-
point arithmetic or complicated definitions of sin and cos. This helps to
concentrate on a good algorithm.

Another difference is the time limit. For my challenge you have much time,
so you can think and test a lot and perhaps there will be some interesting
ideas or variations of the challenge submitted.

--
Frank Buß, fb@frank-buss.de
http://www.frank-buss.de, http://www.it4-systems.de
Jul 22 '05 #7
Frank Buss wrote:
Neo-LISPer <ne********@yahoo.com> wrote:
Terribly similar to ICFP 2003. No 1 or 3-day time constraint. What's
the fun in that?


I know this challenge (to the other readers: you can see it at
http://www.dtek.chalmers.se/groups/icfpcontest/ ) and I liked the idea,
this is one of the reason for this challenge.


You might want to give proper credit then. Otherwise, some people might call
it plagiarism (sponsored by DrDobbs ?)
Jul 22 '05 #8
Frank Buss wrote:
A new challenge:

http://www.frank-buss.de/marsrescue/index.html

Have fun! Now you can win real prices.

Please correct the typos in the spelling of "devided" and "devision". It
should be "divided" and "division".

--
Surendra Singhi

www.public.asu.edu/~sksinghi
Jul 22 '05 #9

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

198
by: Michael N. Christoff | last post by:
Java, the software developed by Sun Microsystems in the mid-1990s as a universal operating system for Internet applications, gave NASA a low-cost and easy-to-use option for running Spirit, the...
23
by: jacob navia | last post by:
There was a discussion some weeks ago about the C language being "dead", where Mr Tisdale, as far as I know a NASA employee, participated telling us that he is waiting for C programmers to die...
3
by: LW | last post by:
"Consider the U.S. government's recognition and protection of intellectual property in the computer industry. Inventors of computer hardware were able to patent their inventions, and the government...
4
by: jacob navia | last post by:
The Mars lander Phoenix uses the best language for the job. Here is an excerpt of the interview of O'Reilly with Peter Gluck, NASA software engineer. <quote> That's right. Yeah. The...
32
by: jhc0033 | last post by:
Interesting article I came across on Slashdot: http://developers.slashdot.org/developers/08/07/10/213211.shtml They are using C at JPL to program Mars Lander and just about everything now! Not...
0
by: antdb | last post by:
Ⅰ. Advantage of AntDB: hyper-convergence + streaming processing engine In the overall architecture, a new "hyper-convergence" concept was proposed, which integrated multiple engines and...
0
hi
by: WisdomUfot | last post by:
It's an interesting question you've got about how Gmail hides the HTTP referrer when a link in an email is clicked. While I don't have the specific technical details, Gmail likely implements measures...
0
Oralloy
by: Oralloy | last post by:
Hello Folks, I am trying to hook up a CPU which I designed using SystemC to I/O pins on an FPGA. My problem (spelled failure) is with the synthesis of my design into a bitstream, not the C++...
0
BLUEPANDA
by: BLUEPANDA | last post by:
At BluePanda Dev, we're passionate about building high-quality software and sharing our knowledge with the community. That's why we've created a SaaS starter kit that's not only easy to use but also...
0
by: Rahul1995seven | last post by:
Introduction: In the realm of programming languages, Python has emerged as a powerhouse. With its simplicity, versatility, and robustness, Python has gained popularity among beginners and experts...
2
by: Ricardo de Mila | last post by:
Dear people, good afternoon... I have a form in msAccess with lots of controls and a specific routine must be triggered if the mouse_down event happens in any control. Than I need to discover what...
1
by: ezappsrUS | last post by:
Hi, I wonder if someone knows where I am going wrong below. I have a continuous form and two labels where only one would be visible depending on the checkbox being checked or not. Below is the...
0
by: jack2019x | last post by:
hello, Is there code or static lib for hook swapchain present? I wanna hook dxgi swapchain present for dx11 and dx9.
0
by: F22F35 | last post by:
I am a newbie to Access (most programming for that matter). I need help in creating an Access database that keeps the history of each user in a database. For example, a user might have lesson 1 sent...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.