Many problems of Borel combinatorics can be formulated as the existence of Borel equivariant maps from the Bernoulli shifts to some subshifts of finite type. We consider the case in which the acting group is a finitely generated free abelian group. We show that in the one-dimensional case the problem is computable, and in the two-dimensional case, the continuous problem is c.e.-complete.