About this document
Maximum Knights on Chessboard by Asif Anwar Sajid is a document available to read on EtoBox.
This document describes a problem involving placing chess knights on an m x n chessboard where no two knights can attack each other. It provides that a chess knight can attack 8 positions on the board. The input specifies the number of test cases T, each containing the number of rows m and columns n of the board. For each case, the output should print the case number and maximum number of knights that can be placed on the board while following the restrictions.
- Author
- Asif Anwar Sajid
- Language
- EN