# Most moves by Most number of Pieces

Using one color, White or Black, place as many chess pieces (kings, queens, bishops, knights, rooks, and pawns, or combinations thereof) as you can on a checkerboard so that when the number of pieces is multiplied by the number of the possible moves, we get the greatest value S , where S = (no.of pieces) X (no. of moves). Without having the pieces attacking each other, what is the greatest value possible?

• Does "without attacking" mean "without threatening" (which would limit the number of pieces) or do just mean without counting attacking moves? – Daniel Mathias Mar 21 '20 at 0:30
• @Daniel Mathias-It seems that my answer to your comment on had never added. That is, without attacking or capturing or threatening of other pieces . Thus Qs cannot be side by side – TSLF Mar 21 '20 at 6:56
• Answer updated accordingly. – Daniel Mathias Mar 21 '20 at 11:30

32 knights and the number of possible moves for each:
32*168=5376