At a funfair game stall, players are allowed to choose two cards at random from six cards, with each card labelled with one letter from A to F. The player’s score, denoted by \(X\), is the Manhattan distance between the two squares corresponding to the player’s two chosen letters on the grid below,
| \(\mathrm{A}\) | \(\mathrm{B}\) | \(\mathrm{C}\) |
|---|---|---|
| \(\mathrm{D}\) | \(\mathrm{E}\) | \(\mathrm{F}\) |
where the Manhattan distance between two squares is the minimum total number of horizontal and vertical steps required to travel between them. For example, the Manhattan distance between B and F is \(2\), while the Manhattan distance between D and C is \(3\).
The stall owner charges \(\$10\) per game and rewards the player with a cash prize, in dollars, of \(\frac{k}{10}\) times of the square of the player’s score, where \(k\) is a positive integer.
Video solution locked
A free account saves your progress; this video needs tuition enrolment.
680+ questions here come with free worked solutions. A free account saves your questions and progress; this one needs tuition enrolment.
Create a free account to practise similar questions.
Need help? Join our JC Math tuition classes.
Learn more