In two neigbouring cells(dimensions $1\times 1$) of square table $10\times 10$ there is hidden treasure. John needs to guess these cells. In one $\textit{move}$ he can choose some cell of the table and can get information whether there is treasure in it or not. Determine minimal number of $\textit{move}$'s, with properly strategy, that always allows John to find cells in which is treasure hidden.
1. **Initial Assumptions and Necessity of 50 Moves:**
   - John needs to find both squares with treasure.
   - He does not need to make moves on the squares with treasure; he just needs to identify them.
   - We need to show that 50 moves are necessary.
   
   Suppose John makes 49 moves or fewer. Consider tiling the board with horizontal dominoes and separately with vertical dominoes. There will be at least one horizontal domino and one vertical domino on which no moves have been made. It is possible for John to have never found treasure in his 49 moves, and then he cannot tell whether the two squares with treasure are in that horizontal domino, that vertical domino, or somewhere else. Therefore, 49 moves are insufficient, and 50 moves are necessary.

2. **Strategy with 50 Moves:**
   - Color the board in a checkerboard pattern with black and white squares.
   - First, John checks the 32 white squares on the interior of the board.
     - If any of these squares have treasure, he checks the 4 surrounding squares to identify the exact location of the treasure.
     - This step ensures that if the treasure is found in the interior, John can identify it within 50 moves.
   
3. **Checking the Edge Squares:**
   - If no treasure is found in the 32 interior white squares, John next checks the 16 white squares on the edge but not in a corner.
     - If any of these edge squares have treasure, he checks 2 of the 3 surrounding squares to identify the exact location of the treasure.
     - This step ensures that if the treasure is found on the edge, John can identify it within 50 moves.
   
4. **Final Check for Corner Squares:**
   - If John has not found any treasure in the 48 moves so far, the only remaining white squares that can have treasure are the two white corners, which we will call \( S \) and \( T \).
   - John checks \( S \) first.
     - If \( S \) has treasure, his final move is to check a square adjacent to \( S \), and the result of that check will be enough to identify the exact location of the treasure.
     - If \( S \) does not have treasure, his final move is to check a square adjacent to \( T \), and since he can be certain \( T \) has treasure, this will be enough to identify the exact location of the treasure.

By following this strategy, John can always find the cells with the hidden treasure within 50 moves.

The final answer is \( \boxed{50} \)