Square ABCD in the coordinate plane has vertices at the points A(1, 1), B(−1, 1), C(−1, −1), and D(1, −1). Consider the following four transformations: L, a rotation of 90° counterclockwise around the origin; R, a rotation of 90° clockwise around the origin; H, a reflection across the x-axis; and V, a reflection across the y-axis. Each of these transformations maps the square onto itself, but the positions of the labeled vertices will change. For example, applying R and then V would send the vertex A at (1, 1) to (−1, −1) and would send the vertex B at (−1, 1) to itself. How many sequences of 20 transformations chosen from ${L, R, H, V}$ will send all of the labeled vertices back to their original positions?
坐标平面上的正方形 $ABCD$ 的顶点位于点 A(1, 1)、B(−1, 1)、C(−1, −1) 和 D(1, −1)。考虑以下四个变换:L,绕原点逆时针旋转 90°;R,绕原点顺时针旋转 90°;H,关于 x 轴反射;V,关于 y 轴反射。这些变换中的每一个都将正方形映射到自身,但标记顶点的位置会改变。例如,先施加 R 再施加 V 会将顶点 A(1, 1) 发送到 (−1, −1),将顶点 B(−1, 1) 发送到自身。从 ${L, R, H, V}$ 中选择的 20 个变换序列有多少个会使所有标记顶点回到原始位置?