성냥개비 등식 퍼즐 게임 알고리즘 설계 및 구현

초록

The matchstick game is enjoyed by people of all ages and genders. Although various versions of this game exist, the most common variant involves rearranging a limited number of matchsticks from a given initial configuration to either complete a mathematical expression or construct a specific geometric shape. In this study, we implemented an algorithm to examine the feasibility of moving a given number of matchsticks to complete a specific equation and, if possible, identify the possible matchstick combinations. The experimental results showed that the proposed algorithm could be effectively utilized in checking answers of and designing games involving the rearrangement of one to three matchsticks to complete an equation, which is typically enjoyed by players.

키워드