• The application is a simulation of a toy robot moving on a 5 x 5 unit tabletop
• There are no obstructions on the table surface
• The robot is free to roam the surface of the table but must be prevented from falling to destruction
• Each position of the table is referred to by an X,Y coordinate
• The robot can face NORTH, SOUTH, EAST, or WEST
• The origin of the table is the south west most corner
• All erroneous commands are ignored
• All commands received before a valid PLACE command are ignored

The commands that the robot accepts are as follows:

My solution to the above problem has been written in Go. This is my first real Go application so I'm sure that in many ways my solution is not really idiomatic.

The easiest way to run the application is with go run as follows:

# Entering a command at a time (use Ctrl-D to quit)
$ go run main.go
PLACE 0,0,NORTH
MOVE
REPORT
0,1,NORTH

# Redirecting standard input
$ go run main.go < test_resources/input.txt                                                    ⏎
0,0,NORTH
0,1,NORTH
...

# Using a heredoc
$ go run main.go <<EOF
heredoc> PLACE 0,0,NORTH
heredoc> MOVE
heredoc> REPORT
heredoc> EOF
0,1,NORTH

The solution has both unit and acceptance tests. The following commands can be used to run the tests:

# Run all the tests
$ go test ./...