0 votes 0 votes Find a recurrence relation for the number of ways to completely cover a $2 \times n$ checkerboard with $1 \times 2$ dominoes. [Hint: Consider separately the coverings where the position in the top right corner of the checkerboard is covered by a domino positioned horizontally and where it is covered by a domino positioned vertically.] What are the initial conditions for the recurrence relation in part $(A)?$ How many ways are there to completely cover a $2 \times 17$ checkerboard with $1 \times 2$ dominoes? Combinatory kenneth-rosen discrete-mathematics counting descriptive + – admin asked May 2, 2020 admin 184 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
