In this paper we suggest a new class of search games, namely, screening and hiding versus search games. This new class of search games is motivated by the book Search and Screening by Koopman who is the founder of the modern search theory. In our game a hider is not just trying to find the best places to hide resources from a searcher, but also it applies efforts to screen their allocations making it more difficult for the searcher to find them. This hiding and screening strategy of the hider versus search strategy of the searcher makes the plot more real-world relative comparing to widely investigated in literature just hiding versus search games. For the suggested game we found the equilibrium strategies of both players as well as we proved uniqueness of the equilibrium.