Problem Solving

试题详情

题目:

 In the game of chess, the Knight can make any of the moves displayed in the diagram below. If a Knight is the only piece on the board, what is the greatest number of spaces from which not all 8 moves are possible? 

选项:

A、A 8
B、B 24
C、C 38
D、D 48
E、E 56

答案:

D

提问:

老师,这道题是要求什么? 我没有看懂能给我讲一下吗?
评分: 0
浏览: 2170

提问:

是说一共8*8=64个格子 然后knight最多走2*8=16个格子 然后64-16=48吗
评分: 0
浏览: 2180
点我领取
免费专项课程
在线咨询