A function 𝑓: 𝑉 → 𝑁 ∪ {0} is said to be even hamming distance labeling if there exist an induced function 𝑓 ∗ ∶ 𝐸 → {2,4,6, … 𝑛} such that for every 𝑢𝑣 ∈ 𝐸, 𝑓 ∗ (𝑢𝑣) = ℎ𝑑([𝑓(𝑢)]2 ,[𝑓(𝑣)]2 ) satisfies the following conditions: (i) For every vertex 𝑣 𝜖 𝑉, the set of all edges incident with 𝑣 receive distinct even numbers as labels. (ii) For every edge 𝑒 = 𝑢𝑣, the adjacent vertices 𝑢 and 𝑣 receive distinct labels. The even hamming distance number of a graph G is defined as the least positive integer n such that 2 𝑛 − 1 ≥ 𝑘, where 𝑘 = max{𝑓(𝑣)/𝑣 ∈ 𝑉} and is denoted by ηℎ𝑑 ′′ (G). In this paper we obtain the even hamming distance number of Triangular Snake graph, Alternate Triangular Snake, Quadrilateral Snake and Alternate Quadrilateral Snake.