A polynomial time algorithm is given for deciding, for a given polyomino P,
whether there exists an isohedral tiling of the Euclidean plane by isometr
ic copies of P. The decidability question for general tilings by copies of
a single polyomino, or even periodic tilings by copies of a single polyomin
o, remains open.