论文部分内容阅读
科技创新大赛中,经常会遇到很多与排列、组合或数列有关的计数问题,现举一例.问题如图1,在某市举办的机器人灭火比赛中,比赛规则要求机器人从顶点A开始,沿正8边形的边去搜寻位于顶点E处的火并将其熄灭.如果机器人在任何一个不是E的顶点,那么它可以走到相邻顶点中的任一点,当它?
In the scientific and technological innovation contest, we often encounter many counting problems related to permutation, combination or sequence, and let’s cite one example. As shown in Figure 1, in a robot fire extinguishing competition held in a certain city, the competition rules require that the robot start from the vertex A, The regular 8-sided edge searches for and extinguishes the fire at vertex E. If the robot is at any vertex other than E, can it reach any of the adjacent vertices when it?