i assume there are N columns and 2 rows
the left tiles are either
aa
bb
or
a
a
so the recurrence is fN= fN-1+fN-2, fibonacci
What is the number of ways can you cover a Nx2 board using 1x2 tiles....??
i assume there are N columns and 2 rows
the left tiles are either
aa
bb
or
a
a
so the recurrence is fN= fN-1+fN-2, fibonacci
no not n!
adroit has done it correctly :)
Try to figure out a simple explanation or solution :)