We demonstrate the similarities and differences between normal play games and mis`ere play combinatorial games. In particular, we examine the question of why the analysis of mis`ere play games is more difficult than their normal counterparts. Mis`ere games form a partial order similar to that of normal play games and we show the form of a game can be simplified through domination and reversibility, defined appropriately