For each integer n>=1, let G_n be the graph whose vertices are the squares of an n by n chessboard, with two squares adjacent when a chess knight can move between them. Let gamma_n be the minimum size of a dominating set in G_n. Does the limit of gamma_n/n^2 exist as n tends to infinity? If it exists, determine its value.