BLOCK_D - BLOCK_D SOLVER
You are given a board of order mxn full of coloured blocks.
At each move, you have to select a block of any colour which has atleast one of it's immediate neighbours of same colour. If you select a block, all the connected blocks(not just the immediate neighbours) of same colour gets destroyed. A block is connected to all the blocks that share an edge with it. Any block will fall directly down if there is no block immediately below it. If a complete column becomes empty, you must either push all the columns to it's left once in the right side or push all the columns to it's right once in the left side(These pushes are not considered as a moves. At each move, you will destroy more than one block).
You will win the game if the remaining number of blocks becomes zero after making the moves. Find the minimum number of moves to win the game. If it is impossible to win the game, print -1.
For better understanding of gameplay you may have a look at this video. (optional)
The first line consists of an integer t, the number of test cases. For each test case the first line consists of two integers m, n the number of rows and columns respectively followed by the matrix representing the coloured blocks. Colour[i][j] contains any character between 'a' and 'e' inclusive.
For each test case print the minimum number of moves to win the game. If it is impossible to win, print -1.
Hmm, the grid can actually be up to 10x10, not 8x8
Note that test cases seem to allow a "straight forward" method. You don't have to take into account pessimistic cases.
The video is private :(