1 / 19

421

421. 420. 411. 321. 410. 401. 320. 311. 221. 4. 2. 1. 400. 310. 301. 220. 211. 121. Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300. 210. 201. 120. 111. 021. 200. 110. 101. 020. 011. 100. 010. 001. 000. 420. 411. 321. 410.

fmarshall
Download Presentation

421

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 421 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  2. 420 411 321 410 401 320 311 221 400 310 301 220 211 121 4 2 1 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  3. Determining P and N positions

  4. 421 Winning move! 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  5. 421 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  6. 421 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  7. 421 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  8. 421 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  9. 421 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  10. 421 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  11. 421 Winning move! 420 411 321 410 401 320 311 221 4 2 1 400 310 301 220 211 121 Each player can remove 1 or 2 pegs. Player who removes the last peg wins. 300 210 201 120 111 021 200 110 101 020 011 100 010 001 000

  12. 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 P- and N- positions in substraction game with subtraction set {2, 5, 8}. From state K there is a transition to the states K2, K5 and K8 (if those are non-negative).

  13. Generate P and N positions in the subtraction game with substraction set {2, 5, 8}. 2 1 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 2 2 2 2 5 5 5 5 8 8 8 8 8 5 2

  14. Generate P and N positions in the subtraction game with subtraction set {2, 5, 8}. 2 1 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 2 2 2 2 2 2 5 5 5 5 5 5 8 8 8 8 8 8 etc...

  15. Binary representation of positive integers in Fibonacci base base: base: ... 34 21 13 8 5 3 2 1 ... 55 34 21 13 8 5 3 2 1 N = N = 1 0 0 0 0 0 0 0 1 1 25 0 0 1 0 0 0 0 0 1 0 1 1 2 0 0 0 0 0 0 1 1 0 26 0 0 1 0 0 0 1 0 0 1 0 3 0 0 0 0 0 1 1 0 0 27 0 0 1 0 0 0 0 1 1 0 1 0 4 0 0 0 0 0 1 0 0 1 0 28 0 0 1 0 0 0 0 1 0 0 1 0 5 0 0 0 0 1 0 0 0 0 29 0 0 1 0 0 1 0 0 0 0 0 6 0 0 0 0 1 0 0 0 1 0 30 0 0 0 1 0 0 1 0 0 0 0 1 7 0 0 0 0 1 0 0 1 0 0 31 0 0 0 1 0 1 0 0 0 1 0 0 8 0 0 0 0 1 0 0 0 0 32 0 0 0 1 0 1 0 0 0 1 0 0 9 0 0 0 0 1 0 0 0 0 1 33 0 0 1 0 0 1 0 0 1 0 0 1 0 10 0 0 0 0 1 0 0 1 0 0 34 0 1 0 0 0 0 0 0 0 0 11 0 0 0 0 1 0 0 1 0 0 35 0 1 0 0 0 0 0 0 0 1 0 12 0 0 0 0 1 0 0 1 0 0 1 36 0 1 0 0 0 0 0 0 0 1 0 13 0 0 1 0 0 0 0 0 0 37 0 0 1 0 0 0 0 1 0 0 0 14 0 0 0 1 0 0 0 0 0 1 38 0 1 0 0 0 0 0 0 1 0 1 0 15 0 0 0 1 0 0 0 1 0 0 39 0 0 1 0 0 0 1 0 0 0 0 16 0 0 0 1 0 0 1 0 0 0 40 0 0 1 0 0 0 1 0 0 0 1 0 17 0 0 1 0 0 0 0 1 0 0 1 41 0 1 0 0 0 0 0 0 1 0 0 18 0 0 1 0 0 0 1 0 0 0 42 0 1 0 0 0 0 1 0 0 0 0 19 0 0 0 1 0 1 0 0 0 1 0 43 0 0 1 0 0 1 0 0 0 0 1 0 20 0 0 0 1 0 1 0 0 1 0 0 44 0 0 1 0 0 0 1 0 0 1 0 0 21 0 0 1 0 0 0 0 0 0 45 0 1 0 0 0 0 1 0 1 0 0 0 22 0 1 0 0 0 0 0 0 1 0 46 0 0 1 0 0 0 1 0 1 0 0 0 1 23 0 0 1 0 0 0 0 0 1 0 47 0 0 1 0 1 0 0 0 0 0 0 24 0 1 0 0 0 0 1 0 0 0 48 0 0 1 0 1 0 0 0 0 0 1 0

  16. Fibonacci Nim: One pile of tokens. First player can remove 1 or more tokens but not all of them. Next, each player than can remove at most twice the number of tokens removed in his oponent's last move. Player who removes last token wins. base: ... 55 34 21 13 8 5 3 2 1 N = 25 0 0 0 1 0 0 0 0 1 0 1 1 26 0 0 0 1 0 0 1 0 0 1 0 27 0 0 1 0 0 0 0 1 1 0 1 0 28 0 0 1 0 0 0 0 1 0 0 1 0 29 0 0 1 0 0 0 1 0 0 0 0 30 0 0 1 0 0 0 1 0 0 0 1 0 31 0 0 1 0 0 1 0 0 0 0 1 0 32 0 0 1 0 0 1 0 0 0 1 0 0 Let: N be the current number of tokens. RemLim be maximum tokens which can be currently removed. Fmin be the rightmost base element present in N (rightmost 1). 33 0 0 1 0 0 1 0 0 1 0 0 1 0 34 0 1 0 0 0 0 0 0 0 0 35 0 0 1 0 0 0 0 0 0 0 1 36 0 1 0 0 0 0 0 0 0 1 0 37 0 0 1 0 0 0 0 1 0 0 0 38 0 0 1 0 0 0 0 1 0 0 0 1 39 0 1 0 0 0 0 1 0 0 0 0 40 0 1 0 0 0 0 0 1 0 0 1 0 Then: RemLim < Fmin ....... P-position RemLim >= Fmin ........N-position 41 0 1 0 0 0 0 0 0 1 0 0 42 0 1 0 0 0 0 1 0 0 0 0 43 0 0 1 0 0 0 1 0 0 0 1 0 44 0 0 1 0 0 0 1 0 0 0 1 0 45 0 1 0 0 0 1 0 0 0 1 0 0 Rule: In N-position remove Fmin tokens. 46 0 0 1 0 0 0 1 0 1 0 0 1 0 47 0 0 1 0 1 0 0 0 0 0 0 48 0 1 0 0 0 1 0 0 0 0 1 0

  17. RemLim < Fmin ....... P-position RemLim >= Fmin ........N-position base: ... 55 34 21 13 8 5 3 2 1 N = 25 0 0 1 0 0 0 0 1 0 0 1 1 Example: Pile with 45 tokens. 26 0 0 0 1 0 0 1 0 0 1 0 27 0 0 0 1 0 0 1 0 1 0 1 0 28 0 0 0 1 0 0 1 0 0 0 1 0 First move: N = 45, RemLim = 44, Fmin = 3. RemLim >= Fmin .... N-position Remove Fmin: N = 45 3 = 42 29 0 0 1 0 0 0 1 0 0 0 0 30 0 0 0 1 0 1 0 0 0 0 1 0 31 0 0 1 0 0 1 0 0 0 0 1 0 32 0 0 1 0 0 0 1 0 1 0 0 0 33 0 0 0 1 0 0 1 0 1 0 0 0 1 34 0 1 0 0 0 0 0 0 0 0 35 0 0 1 0 0 0 0 0 0 1 0 Next move: The opponent can remove 1 to 6 tokens, that is, he can set the pile to 41, 40, 39, 38, 35, 35 tokens. All these are N-positions, because RemLim = 6, Fmin <= 5. 36 0 0 1 0 0 0 0 0 1 0 0 37 0 1 0 0 0 0 0 0 1 0 0 38 0 0 1 0 0 0 0 1 0 0 1 0 39 0 1 0 0 0 0 0 1 0 0 0 40 0 1 0 0 0 0 1 0 0 0 1 0 41 0 1 0 0 0 0 0 0 0 1 0 42 0 1 0 0 0 1 0 0 0 0 0 43 0 0 1 0 0 0 1 0 0 0 1 0 44 0 1 0 0 0 1 0 0 0 1 0 0 45 0 1 0 0 0 0 1 0 1 0 0 0 46 0 1 0 0 0 1 0 0 1 0 0 1 0 47 0 1 0 0 0 1 0 0 0 0 0 48 0 1 0 0 1 0 0 0 0 0 1 0

  18. RemLim < Fmin ....... P-position RemLim >= Fmin ........N-position base: ... 55 34 21 13 8 5 3 2 1 N = 25 0 0 1 0 0 0 0 1 0 0 1 1 Example continues: Opponent took 4. Pile with 38 tokens. 26 0 0 1 0 0 0 0 1 0 1 0 27 0 0 1 0 0 0 1 0 1 0 0 1 28 0 0 1 0 0 0 0 1 0 0 1 0 29 0 0 1 0 0 1 0 0 0 0 0 30 0 0 1 0 0 1 0 0 0 0 1 0 Next move: N = 38, RemLim = 8, Fmin = 1. RemLim >= Fmin .... N-position Remove Fmin: N = 38 1 = 37 31 0 0 0 1 0 1 0 0 0 0 1 0 32 0 0 0 1 0 0 1 0 0 1 0 0 33 0 0 0 1 0 1 0 0 1 0 0 0 1 34 0 0 1 0 0 0 0 0 0 0 35 0 1 0 0 0 0 0 0 0 1 0 36 0 0 1 0 0 0 0 0 0 1 0 Next move: The opponent can remove 1 or 2 tokens, that is, he can set the pile to 36 or 35 tokens. All these are N-positions, because RemLim = 2, Fmin <= 3. 37 0 0 1 0 0 0 0 0 1 0 0 38 0 0 1 0 0 0 0 0 1 0 1 0 39 0 1 0 0 0 0 1 0 0 0 0 40 0 1 0 0 0 0 0 1 0 0 0 1 41 0 0 1 0 0 0 0 0 1 0 0 42 0 0 1 0 0 0 1 0 0 0 0 43 0 0 1 0 0 0 1 0 0 0 1 0 44 0 1 0 0 0 1 0 0 0 1 0 0 45 0 1 0 0 0 0 1 0 0 1 0 0 46 0 1 0 0 0 0 1 0 1 0 0 0 1 47 0 0 1 0 1 0 0 0 0 0 0 48 0 0 1 0 1 0 0 0 0 0 0 1

More Related