This is a visual representation of the bitmap logic needed for connect four win detection. As scratch does not have bitwise operators, this project uses laggy workarounds. Click on the leftmost board to cycle through piece states, and view how the upper row (2 in a row detection), and the bottom row (2 in a row in the two in a row detection) change.
Trying out a new turbowarp feature, supposedly I can link the project and have it use the BigInt extension for bit shifting instead. Runs much smoother, even with recalculating everything every frame. If you can get this to work, holler https://turbowarp.org/?extension=https://extensions.turbowarp.org/Skyhigh173/bigint.js&project_url=https://flameddogo99.github.io/test.sb3 This visualization was created to help understand a project for CSCI366 at Montana State.
