In the localization game on a graph, goal is to find fixed but unknown target node $v^\star$ with least number of distance queries possible. $j^{th}$ step game, player single $v_j$ and receives, as an answer their query, between nodes $v^\star$. The sequential metric dimension (SMD) minimal that needs guess absolute certainty, no matter where is. term SMD originates from related notion (MD), wh...