The Unshackle game is a combinatorial game for two players that starts with prisoners and shackles on a board such that each shackle has two ends, and each end is shackled to one prisoner. Two players alternately take turns by destroying a shackle on the board until all shackles have been destroyed. A prisoner is free when all shackles that are shackled to him are destroyed, and the player who frees the most prisoners wins and the other loses. Both players draw if neither of them can win. The prisoners and the shackles on the board can be considered as vertices and edges of a graph. This article determines the outcomes of the Unshackle games on 2m × (2n + 1) grid graphs by constructing a winning strategy for the second player, and determines the outcomes of the Unshackle games on ladder graphs and on ladder-like graphs by using mathematical induction.