We study the localization game on dense random graphs. In this game, a cop tries to locate a robber by asking for the graph distance of from every vertex in a sequence of sets . We prove high probability upper and lower bounds for the minimum size of each that will guarantee that will be able to locate .