CD Tesis
Operator Mex Untuk Pemenangan Permainan Fraenkel Tiga Tumpukan
This thesis discusses a formula to reconstruct the P-position of three-pile Fraenkel game by using mex operator. P-position is a dynamic position where a gamer can decide his victory. The result shows that P-position of three-pile Fraenkel game is a series (An;j ,Bn;j ,Cn;j), with the value of An;j is the smallest positive integer which does not exist in (Ai;j ,Bi;j ,Ci;j) with 0 ≤ i < n, while the value of Bn;j , and Cn;j can be recursively obtained from An;j . From this discussion, it can be concluded that there are (j + 1) series of P-position for each n integer, with the value of j is the integer started from zero to the lowest value of n/2
Keywords: Mex operator, P-position, Fraenkel game
Tidak tersedia versi lain