The Game That Learns

43 thoughts on “The Game That Learns”

1. I wanted to respond to two types of comments that have appeared more than once. I read all the comments and really appreciate when you all dig deep into these topics.

   First, we're missing some matchboxes because we don't actually need them! Some matchboxes work for two scenarios — once for the board position they display, and also for the board position that is a mirror image of it. The computer learns both board positions at the same time, but yes, at first glance it appears as though I just left some out. Martin Gardner didn't think they were necessary, either.

   Second, Hexapawn is a much simpler version of chess, so terms like "checkmate" and "stalemate" aren't exactly the same. They're simpler, too. In chess, checkmate is achieved when there is no way for your opponent to move without the king being captured. A stalemate occurs when a player has no legal move. A stalemate results in a draw.

   So, when that occurs in Hexapawn, it has the trappings of a stalemate but has the result and the spirit of a checkmate — the win is awarded to the player who moves in a way that creates a stalemate for their opponent. Because the situation results in a win instead of a draw, I thought it was more appropriate to compare it to checkmate, though it may have been clearer to avoid the language of "checkmate" entirely.

2. FODASE

3. Please don't play that awful music ever again.

4. This is why AI isn't conscious. It is just a machine that works on the matchbox mechanism, only amplified using electrical signals and logic gates.

5. Wish my DOTA 2 team mates were as smart as these match boxes

6. 3:34 Market Gardener?

7. that got personal real fast…

8. what if you made a computer simulation of this, started by yourself, and then replaced yourself with another one of the AIs.
   better yet, imagine making a chess version of this

9. My referral link to the game! It will give you a boost start boyz
   @t

10. My referral link to the game! It will give you a boost start boyz
    @t

11. My referral link to the game! It will give you a boost start boyz
    @t

12. My referral link to the game! It will give you a boost start boyz
    @t

13. My referral link to the game! It will give you a boost start boyz
    @t

14. Great music!

15. 9:04 To all the PC parents, don't simply reward your kids, punish them as well. But not abusively! Like you all assume the word punishment means… weirdos.

16. Gotcha…

17. I don't get it

18. 2:57 You mean STALEmate, I CAN’T BELIEVE A SEVENTEEN YEAR OLD CORRECTS YOU ON THAT!!

19. I literally got an ad on AI and machine learning in the beginning of the video by Coursera.
    ?‍♂️?

20. 🙂

21. HEY NOW!!! YOU'RE AN ALLSTAR!!! GET YOUR GAME ON!!!

22. 2:58 you said checkmate but you were describing stalemate
    Edit: I just red your comment woops

23. Me:goes to get a bunch of matchboxes

24. And… SHREK

25. here's a question, who dislikes this? i mean really? what are they even watching this for?

26. so, it would be possible to create a perfect computer for chess out of… how many thousands of gigantic matchboxes?

27. I'm 12 years old and love your videos keep producing the content?

28. Bottom row, 5th matchbox
    Attomatic loss for AI
    Bead removed
    If that scenario happens again, then what?
    similar to others

29. Sherk is god

30. lemme take my lil matchbox computer to a worldwide hexapawn championship

31. Let’s say when you took out the orange and blue bead, you lost.

    Do you take out both beads, or only one???

32. 6:31
    Oh no… Don't let Kevin win this round…

33. Nobody:

    Me: Is this machine learning?

34. 5:06

35. That video was quite the emotional rollercoaster

36. So basically if you learn all the moves that are made by computer when it gets perfected(when it always wins)
    You could never lose to another human if you go second

37. Only 2 round 2 matchboxes? Then what if i move the farthest right pawn?

38. Best video about AI EVER!!

39. It wasn't clear to me, but I presume you are only removing the last bead when it loses (vs the preceding bead(s)). Also, in your alternate reward version, are you adding beads along the entire decision path?
    And finally a question for your reward version: what if you took the number of moves to the winning move (say, 3 moves) and placed n! beads in reverse order (so for 3 moves, 6 beads added: 3 to the last move, 2 to the previous move and 1 to the initial move) giving much more weight much more rapidly to those paths?

    And last question because I find this very interesting (glad I found this channel): it seems to me that the simplification is great to help understand decision trees but that the moment you go up an order, you have to change your evaluation of paths because an initial move may be for a branch of all losing paths down the tree so could you end up with a dead-end path at the third move? I guess that would represent a resignation? I don't know if I'm thinking about this correctly, I'm no mathematician.

40. What would happen if you had 2 computers playing against each other? You would have to always make the first move, but then just let it play out

41. touches stove
    remove bead
    get icecream because i touched stove
    add bead

    /life,

42. Perfect definitive proof that bullying is good for society…. To a certain degree

43. Fantastic video

Comments are closed.