2023 AMC 10B Problem 10

You are playing a game. A $2$ $\times$ $1$ rectangle covers two adjacent squares (oriented either horizontally or vertically) of a $3$ $\times$ $3$ grid of squares, but you are not told which two squares are covered. Your goal is to find at least one square that is covered by the rectangle. A "turn" consists of you guessing a square, after which you are told whether that square is covered by the hidden rectangle. What is the minimum number of turns you need to ensure that at least one of your guessed squares is covered by the rectangle?