An exercise to underline the Dependency Inversion Principle, using C++ and Visual Studio. Based on Visual Studio 2013.

This exercise is based on the popular board game of snakes and ladders, which you can read up about here https://en.wikipedia.org/wiki/Snakes_and_Ladders, although, to keep things more simple, this version has only snakes and no ladders. You should make sure you're familiar with the rules. Here's a clear, succinct version: http://www.ehow.com/facts_5163203_snakes-amp-ladders-rules.html.

1. Clone the repository, check the master branch (this happens by default)
2. Open Visual Studio
3. Open the solution file, DependencyInversionPrinciple.sln, in the root directory of the repository
4. Build the project in Debug
5. Run the tests, Debug/SnakesAndLaddersTests.exe
6. Have a look at the code in SnakesAndLadders and SnakesAndLaddersTests, as indicated below:

In ConsoleBasedGame, there's an version of the game you and run on a console and play. It has a simple implementation of main() in ConsoleBasedGame.cpp.

In SnakesAndLadders, there's an implementation of the game that doesn't adhere to the DependencyInversionPrinciple. It has the following classes:

There are no tests for SnakesAndLadders, but there is a project, SnakesAndLaddersTests, which is already set up for writing acceptance tests on the game. Currently, the only way to test the implementation is to run Debug\ConsoleBasedGame.exe manually.

Your task is to write a test to prove that, given a move that overshoots the end of the board by one, the player ends up on the square before the last one. SnakesAndLaddersTests\MoveTests.cpp, you'll find a test case declaration that just needs filling in.

TEST(MoveTests, GivenAPlayerOnSquare97_WhenTheyMove3_TheyShouldEndUpOnSquare98)
{
}

Now write a test to prove that, given a move that lands a player on snake, that they end up at the bottom of the snake.

TEST(MoveTests, GivenASnakeFromSquare2To1_WhenAPlayerMovesOnToSquare2_TheyShouldEndUpOnSquare1)
{
}

The next task is to write a test to prove that the game ends when a player reaches the last square on the board. Note that you are now testing SnakesAndLadders, and so you need a new test suite. The test case should look something like this;

TEST(SnakesAndLaddersTests, WhenAPlayerLandsOnTheLastSquare_TheGameShouldEnd)
{
}

Your last task is to prove that when a player throws the die, they move the number of squares shown. You test could be something like this.

TEST(SnakesAndLaddersTests, GivenAPlayersThrowMissesAnySnakesAndDoesntReachTheEndOfTheBoard_WhenAPlayerMoves_TheyShouldMoveForwardTheNumberOfSquaresThrown)
{
}

Now check the branch 'DependencyInversion', where is a version of the game that adheres more to the Dependency Inversion principle.

Try tasks 1 - 4 again, starting with this code.