| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 5 초 | 512 MB | 45 | 5 | 5 | 62.500% |
The game of chess is almost finished. On the chessboard, apart from White and Black kings, there is only a White rook.
You are playing White, and it is your move. Determine the minimal number of moves you need to give a checkmate, provided that your opponent plays optimally and delays his inevitable defeat for as long as possible.
There is a compilation of chess rules at the end of this statement. If you already know them, rest assured: your puny chess skills will not help you solve this problem.
The first line of input contains the number of test cases $z$ (1ドル \leq z \leq 10$). The descriptions of the test cases follow.
Each test case is given on eight lines describing a chessboard. Each of these lines describes a single row and contains exactly eight characters: '.' denotes an empty field, 'W' is the White king, 'B' is the Black king, and 'R' is the White rook. There is exactly one piece of each kind. The starting position is guaranteed to be valid: in particular, kings are not adjacent to each other, and the Black king is not under attack.
There is an empty line after each test case.
For each test case, output a line containing a single integer: the maximal possible number of moves White needs to give a checkmate (per common tradition, count only your moves, not Black's).
2 ........ ........ ........ ........ ........ .......W R....... .......B ....B... ........ ..W..... ........ .....R.. ........ ........ ........
1 2
Chess rules: