Peg-coci
In the famous logic game Peg, pieces jump over other pieces to remove them from the game, until only one piece is left. Here is the initial layout of the board:
Image: peg1
The lowercase letter 'o' represents a piece, while the character '.' is an empty square. In one move, a player may choose one piece and one of the four main directions (up, down, left, right), if there is another piece in that direction, and an empty square behind it. The chosen piece jumps over the other
piece and settles in the empty square behind it, while the piece being jumped over is removed from the game. Write a program that calculates the number of legal moves, given the state of the board.
InputThe board is represented by seven lines containing seven characters each. The first two and last two characters on the first two and last two lines are always spaces, and all remaining characters are either 'o' (lowercase letter) or '.' (period character).
OutputOutput the number of legal moves.
Input
Output
Image: peg1
Output
4Input
Output
Image: peg3
Output
12Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.