  In this paper we study three domination-like problems, namely identifying
codes, locating-dominating codes, and locating-total-dominating codes. We are
interested in finding the minimum cardinality of such codes in circular and
infinite grid graphs of given height. We provide an alternate proof for already
known results, as well as new results. These were obtained by a computer search
based on a generic framework, that we developed earlier, for the search of a
minimum labeling satisfying a pseudo-d-local property in rotagraphs.
