Consider a rectangular field of dimensions $nm$ containing certain punc$-$

tured cells. The objective is to maximize the placement of domino dice

$($rectangles of size $12),$ while ensuring that no domino overlays the punc$-$

tured squares. Provide an algorithmic description for this task, along with

its computational complexity.$|$