Difference between revisions of "2024 AMC 8 Problems/Problem 17"
m (Protected "2024 AMC 8 Problems/Problem 17": Excessive spamming ([Edit=Allow only administrators] (expires 17:00, 25 January 2024 (UTC)) [Move=Allow only administrators] (expires 17:00, 25 January 2024 (UTC)))) |
(→Problem) |
||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
+ | |||
+ | A chess king is said to attack all the squares one step away from it, horizontally, vertically, or diagonally. For instance, a king on the center square of a <math>3</math> x <math>3</math> grid attacks all <math>8</math> other squares, as shown below. Suppose a white king and a black king are placed on different squares of a <math>3</math> x <math>3</math> grid so that they do not attack each other. In how many ways can this be done? | ||
+ | |||
+ | (A) <math>20</math> (B) <math>24</math> (C) <math>27</math> (D) <math>28</math> (E) <math>32</math> | ||
+ | |||
==Solution 1== | ==Solution 1== |
Revision as of 16:36, 25 January 2024
Problem
A chess king is said to attack all the squares one step away from it, horizontally, vertically, or diagonally. For instance, a king on the center square of a x grid attacks all other squares, as shown below. Suppose a white king and a black king are placed on different squares of a x grid so that they do not attack each other. In how many ways can this be done?
(A) (B) (C) (D) (E)