Peg Game#770
In the well-known logic game Peg, a player jumps one chip over another. The chip that was jumped over is removed from the board. The game continues until only one chip remains.
The playing field is of size 7 \times 7. The initial placement of the chips on the playing field is as follows:
ooo
ooo
ooooooo
ooo.ooo
ooooooo
ooo
oooA lowercase letter 'o' represents a chip, and a dot '.' represents an empty cell. In one move, a player may select a chip and one of the four directions (up, down, left, right), if in that direction the adjacent cell contains another chip, and there is an empty cell right behind it. The selected chip jumps over the neighboring chip into the empty cell. The chip that was jumped over is removed from the board. Moves outside the edges of the board are not allowed.
Write a program that, given the current arrangement of chips, determines the number of moves the player can make from this position.
The input file contains the description of the current position. The position is given as seven lines, each containing exactly seven characters. The first two and last two characters of the first two and last two lines are always spaces. All other characters are either a dot '.' or a lowercase Latin letter 'o'.
Display a single number: the number of possible moves. The output number should be printed followed by a newline.
Example 1