9 0s are placed from 0th cell to 8th cell of an array; 6 1s are placed from 10th cell to end of the array. On the whole, there are 16 cells, so that just one cell remains unoccupied. 0s only move rightward; 1s move leftward. Every move is either a move to the next empty cell or a jump over one cell which has different value. In any case, no two values are allowed in the same square. The goal is to move 1s into 6 leftmost positions and the 0s into 9 rightmost positions. How many minimum moves are needed to achieve this?
Got the grey cells..............
Can anyone break this tough nut????????????
Got the grey cells..............
Can anyone break this tough nut????????????