Let h(sub n) denote the number of ways to perfectly cover a 1 by n board with monominoes and dominoes in such a way that no two dominoes are consecutive. Find, but do not solve, a recurrence relation and initial conditions satisfied by h(sub n)
answer: h(subn)= h(subn-1)+h(subn-3), (n>=3) with h(sub0)=1 h(sub1)=1 h(sub2)=2© BrainMass Inc. brainmass.com October 10, 2019, 12:17 am ad1c9bdddf
We use "M" to represent monominoes and "D" to represent dominoes. We do not allow "DD" in each cover. Let be the number of ways to cover board. We have the ...
The expert finds the recursive relation.