Chess board problems

Discrete Mathematics Level pending

A chessboard has dimensions \(8\times8\). If there is a domino which can cover two adjacent squares at a time, what is the total number of ways that the domino can cover such that it covers the whole chessboard?

×

Problem Loading...

Note Loading...

Set Loading...