📖 Samacheer Kalvi · 11th TN - English Medium · Computer Science · Page 115question

length of sequence = { · Part 2

Chapter 3: 4 · Computer Science

: Recursive process for power( , ) , , , , , , Chapter Page - - Example . . A corner-covered board is a board of n × n squares in which the square at one corner is covered with a single square tile. A triominoe is a L-shaped tile formed with three adjacent squares (see Figure .

). Cover the corner-covered board with the L-shaped triominoes without overlap. Triominoes can be rotated as needed. Figure .

: Corner-covered board and triominoe The size of the problem is n (board of size n × n ). We can solve the problem by recursion. The base case is n = . It is a × corner-covered board.

We can cover it with one triominoe and solve the problem. In the recursion step, divide the corner- covered board of size n × n into sub- boards, each of size n- × n- , by drawing horizontal and vertical lines through the centre of the board. Place a triominoe at the center of the entire board so as to not cover the corner-covered sub-board, as shown in the left-most

Related topics

Have a question about this topic?

Get an AI answer grounded in your actual textbook — with the exact page reference.

Ask AI about this topic →