The angel problem on triangular and hexagonal boards

The Angel problem, introduced by Conway in 1982, is a two-player game played on an infinite board where an Angel of power k competes against the Devil. We examine variations of this game on triangular and hexagonal boards. Using Mathe?s proof technique originally developed for the square board, we prove that the King (Angel of power 1) can win on a triangular board. Through a mapping between hexagonal and square boards, we then establish two results for the hexagonal board: first, that the Devil can defeat the King, and second, that an Angel of power 2 can win. Our proof for the triangular board involves analyzing the perimeter bounds of connected sets and developing a wall-following strategy for the King, while our hexagonal board results utilize transformations that map to known results from the square board case.