As I'm writing this update, I've been preparing the next post in the Prehistory series, on the 1970 version of Batnum, a possible rewrite and expansion upon this game. While doing so, reading the game's entry in the 1978 edition of BASIC Computer Games, I came across something I missed before. That entry explains how Batnum is based on modulo arithmetic, and how to use it to your advantage.
 |
| The second paragraph is the one in question. |
It explains you need to leave a stack of "1 modulo," which is the maximum number of objects you can take (M) + 1. I interpreted this as meaning that, whatever the computer takes, the amount I take will equal this M + 1 equation.
So, I tried this theory out, and...
 |
| Ha! Suck it, computer! |
Victory!
On my first attempt using this logic, I won. The first turn strategy I went with was removing a single object from the pile. I tried this first game a second time later on with the same strategy, and the same result ensued, suggesting that this is a consistent strategy to win the initial game.
I continued on straight after winning the first game, with the randomised settings, and was overwhelmingly unsuccessful. I consistently lost, though I was able to win a second time eventually. The computer is ruthless after the initial game. It doesn't always follow the modulo logic on its first turn, which always results in it setting up the game for itself to win, but I don't understand the logic behind why it does what it does on the first move. All the explanations of modulo arithmetic I've found online are far too complicated for me to make sense of. Maybe if I start to learn BASIC, I'll be able to look into the code and understand better, who knows.
Here's my video, showing off what I've just described:
I'm just happy to take this off the impossible list.
No comments:
Post a Comment