Combinatorial game theory is the study of two player perfect information games. While work has been done in the past on expanding this field to include n‐player games we present a unique method which guarantees a single winner. Specifically our goal is to derive a function which, given an n‐player game, is able to determine the winning player (assuming all n players play optimally). Once this is accomplished we use this function in analyzing a certain family of three player subtraction games along with a complete analysis of three player, three row Chomp. Furthermore we make use of our new function in producing alternative proofs to various well known two player Chomp games. Finally the paper presents a possible method of analyzing a two player game where one of the players plays a completely random game. As it turns out this slight twist to the rules of combinatorial game theory produces rather interesting results and is certainly worth the time to study further.
