Skip to content

About

Solutions to the "Mars Rovers" problem in various programming languages

Resources

Stars

1 star

Watchers

1 watching

Forks

Latest commit

 

History

160 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This project is for my own personal experimentation with programming languages. A lot of interesting new languages have appeared in recent years, with both remarkable similarities and also remarkable differences between them. Given that tastes also vary, I'm sure each language must be perfect for somebody...but which is perfect for me?

Problem description

MARS ROVERS

A squad of robotic rovers are to be landed by NASA on a plateau on Mars. This plateau, which is curiously rectangular, must be navigated by the rovers so that their on-board cameras can get a complete view of the surrounding terrain to send back to Earth.

A rover's position and location is represented by a combination of x and y co-ordinates and a letter representing one of the four cardinal compass points. The plateau is divided up into a grid to simplify navigation. An example position might be 0, 0, N, which means the rover is in the bottom left corner and facing North.

In order to control a rover, NASA sends a simple string of letters. The possible letters are 'L', 'R' and 'M'. 'L' and 'R' makes the rover spin 90 degrees left or right respectively, without moving from its current spot. 'M' means move forward one grid point, and maintain the same heading.

Assume that the square directly North from (x, y) is (x, y+1).

INPUT
The first line of input is the upper-right coordinates of the plateau, the lower-left coordinates are assumed to be 0,0.

The rest of the input is information pertaining to the rovers that have been deployed. Each rover has two lines of input. The first line gives the rover's position, and the second line is a series of instructions telling the rover how to explore the plateau.

The position is made up of two integers and a letter separated by spaces, corresponding to the x and y co-ordinates and the rover's orientation.

Each rover will be finished sequentially, which means that the second rover won't start to move until the first one has finished moving.

OUTPUT
The output for each rover should be its final co-ordinates and heading.

SAMPLE DATA

Test Input:
5 5
1 2 N
LMLMLMLMM
3 3 E
MMRMMRMRRM

Expected Output:
1 3 N
5 1 E

General principles

I'm looking for a good general-purpose programming language, which scales to large projects. My aim is not to solve this problem in the least lines of code, nor the cleverest way. A concise yet clear and readable solution is the goal.

There are a few "bells and whistles" that I would like to include in each solution, though:

  • It should be possible to express the test cases in code, in a way that resembles their original form in the SAMPLE DATA section of the problem. In other words, the top-level interface should be "DSL-like" (at the very least, "N" for north, "L" for left, and so on should be defined as symbols).

  • Following the principle of separation of concerns, I/O should not be mixed with the business logic.

About

Solutions to the "Mars Rovers" problem in various programming languages

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages