Watch. Click inside to see the code. So basically the question is: "In the following cryptarithm, each different letter represents a different digit in the 6-digit numbers. If B ≠ 0, what is the least sum possible?" The cryptarithm is BATTER+ BETTER + BITTER + BUTTER This project solves that question using the brute force method.
Credits to one person I know who doesn't have a Scratch account. I recommend you not to play the project, because it takes a couple minutes. If you do want to play the project, be sure to turn on Turbo Mode which is shift + green flag.
