返回题库

HMMT 十一月 2017 · 冲刺赛 · 第 27 题

HMMT November 2017 — Guts Round — Problem 27

专题
Contest Math / 竞赛数学
难度
L3
来源
HMMT

题目详情

英文原题

  1. [ 15 ] On a 3 × 3 chessboard, each square contains a Chinese knight with probability. What is the probability that there are two Chinese knights that can attack each other? (In Chinese chess, a Chinese 2
    knight can attack any piece which is two squares away from it in a particular direction and one squareaway in a perpendicular direction, under the condition that there is no other piece immediately adjacentto it in the first direction.)
    HMMT November 2017, November 11, 2017 — GUTS ROUND
    Organization Team Team ID#
解析

英文解析

  1. [ 15 ] On a 3 × 3 chessboard, each square contains a Chinese knight with probability. What is the probability that there are two Chinese knights that can attack each other? (In Chinese chess, a Chinese 2
    knight can attack any piece which is two squares away from it in a particular direction and one squareaway in a perpendicular direction, under the condition that there is no other piece immediately adjacentto it in the first direction.)
    Proposed by: Yuan Yao
    Answer:79
    A B C256
    D E F
    Suppose the 3 × 3 square is We count the number of ways a board could have two knights
    G H Iattack each other using PIE. First notice that in any setup with two knights attack each other, the center square must be empty. Also, for any pair of knights that attack each other, one must be in acorner, and the other at the center of a nonadjacent side. There are 8 · 2 ways for one pair of knights 5
    to attack each other. Next, we count the number of ways two pairs of knights attack each other: up tosymmetry, there are four cases: knights at A, B, G, H, and D and E empty; knights at A, H, F, and
    B, D, E empty; knights at A, B, H, I, and D, E, F empty; and knights at A, C, H, and D, E, F empty.
    3 3 2 3
    Four each of these cases, there are four symmetries, so there are a total of 4 · (2 + 2 + 2 + 2 ) waysto have two pairs of knights attack each other. Next, there’s only one way for three pairs of knightsto attack each other, discounting symmetry: A, B, G, H, I have knights, and D, E, F empty. Thenthere are 4 · 2 · 2 ways for three knights to attack. Finally, there is only one way for four knights toattack: knights at A, B, C, G, H, I and empty squares at D, E, F, for a total of 2 ways after countingsymmetries.
    Applying PIE, we get that the total number of boards with at least one pair of knights attacking eachother is
    5 3 3 2 3
    8 · 2 − 4 · (2 + 2 + 2 + 2 ) + 4 · 2 · 2 − 2 = 158 .
    15879
    Then the probability the 3 × 3 board has a pair of knights attacking each other is = .
    25629