This is a simple turn-based game that can be played by the computer with a very easy-to-make algorithm. Both players' numbers start at 0 and the target number is picked to be big enough to keep the game interesting but not big enough to make it difficult to calculate. The goal of this game is to get your opponent's number to reach or go above the target number before they do the same to your number. The players take turns playing, and each turn a player can add 1 or 1+their own number to their opponent's number. The computer plays automatically after waiting 0.5 second.
This has a tiny bit to do with chopsticks since in chopsticks, you can add more when your own number is larger; you "take out" one of your opponent's hand by making it >= 5, and there are only 2 choices for which number you add each turn. This game doesn't have many possible states but I just want to see what it'd look like if the possibilities were drawn out. A more interesting number game would be nim. The graph shows whether the player who has to make a move can win depending on what the two players' numbers are. (the x-position of a square depends the # of the turn holder and y depends the # of the other player; a black square means that you can win in that situation)
