364. Even and Odd Chips. Place a stack of eight chips in the central circle, as shown in the figure,

![](https://cdn.mathpix.com/cropped/2024_05_21_56f37ca27ac3d928838dg-117.jpg?height=537&width=537&top_left_y=1916&top_left_x=771)
such that the numbers from top to bottom are in order from 1 to 8. The goal is to move the chips $1,3,5,7$ to the circle labeled NEЧET, and $2,4,6,8$ to the circle labeled ЧЕТ. Only one chip can be moved at a time from one circle to another, and a chip with a larger number cannot be placed on a chip with a smaller number. It is also forbidden to place chips of different parity in the same circle simultaneously. For example, you can place chip 1 on chip 3, chip 3 on chip 7, chip 2 on chip 6, or chip 2 on chip 4, but you cannot place chip 1 on chip 2, or chip 4 on chip 7, as this would result in even and odd numbers being in the same circle.

What is the minimum number of moves?
364. The least number of moves is 24. You should act as follows. (It is only necessary to indicate with letters from which circle to which the chip is moved. Only one chip can be moved at a time.) So, \(E\) to \(A\), \(E\) to \(B\), \(E\) to \(C\), \(E\) to \(D\), \(B\) to \(D\), \(E\) to \(B\), \(C\) to \(B\), \(A\) to \(B\), \(E\) to \(C\), \(E\) to \(A\), \(B\) to \(A\), \(C\) to \(E\), \(B\) to \(C\), \(A\) to \(C\), \(B\) to \(A\), \(C\) to \(B\), \(C\) to \(A\), \(B\) to \(A\), \(E\) to \(C\), \(E\) to \(B\), \(C\) to \(B\), \(D\) to \(E\), \(D\) to \(B\), \(E\) to \(B\) - a total of 24 moves.