Getting Started with state compression DP

1, there is a n*m (n<=m) chess board, put N Chinese chess in the car, so that any two cars can not attack each other, a total of how many different programs.

2, there is a n*m (n<=m) chess board, some of the lattice inside can not put, put n a Chinese chess in the car, so that any two cars can not attack each other, a total of how many different programs.

3, there is a n*m (n<=m) of the board, up to the number of Chinese chess in the horse, so that any two horses can not attack each other.

Getting Started with state compression DP