I created a PERFECT minesweeper AI 

0:48 Dam, the ai found all the bombs in less than half a second. Thats really good

Difficulty in minesweeper isn't determined by size, but by density.

Imagine code bullet making a bot that defeats captcha

It's fun seeing how his channel went from explaining everything like a tutorial channel to half of his vocabulary being "I can't be fucked"

You just taught me how to play minesweeper. I never got past clicking and praying.

I used to make 500 by 500 custom maps with only 10 bombs and win with one click

Plot Twist: Code Bullet can't code and is just really good at minesweeper

One flaw in your ai When it comes to a 50/50 situation, sometimes one of the guesses tells you more information.

When I was a kid I taught myself how to play Minesweeper (I didn't have internet don't judge me) by lowering the bomb count and increasing the grid. Then I increased and decreased both respectively as I got better and better at the game. Hell it beat playing solitaire for the umpteenth time

This guy is like mumbo jumbo but with actual coding

If:going-to-touch-bomb Then:don’t+flag CODED

k"CB: We're gonna have to use a little bit of maths and probabilities." Me: "Oh yeah! I'm all about maths, and I especially love probabilities!" CB: "Wait, don't click away! We can make things interesting." Me: "I feel so attacked right now..."

Found a flaw. At 4:48 it randomly chose an edge piece. While mathematically the odds of it being a bomb are the same, the odds of it openning a gap of spaces is lower. Random selection should default to a space as far away from edges and known squares as possible.

Me: "Mom can we have AI?" Mom: "No we already have AI at home" The AI at home: 0:47

*That moment when you click bomb in the first move*

It would be super cool to see the A.I. leave behind a little fraction on each square that he chose, so we could see the probability. If you then plot the percentages, you would have a nice little graph of how hard the game gets for your boy towards the end. 👍 Bravo man, you are awesome.

Code bullet: I hope you enjoyed watching my AI. RU-vid’s Subtitle AI: I hope you enjoyed watching my eye.

Minesweeper. How to win Width: max Height: max Bombs: 10

3:43 No, you.

Next from codebullet an ai the does math homework perfectly =)

“The perfect AI” **AI immediately clicks on a bomb second turn**

6:13 when the minesweeper is sus!

Am I the only one who keeps on getting recommended old videos from him? Even when you think you binged them all somehow there is a new old one which you have never seen. ... Has Code Bullet hacked time???

*M A T H* and _PROBABILITY.._ made it very interesting to watch.

I was today years old when I learned that the numbers actually mean something in minesweeper.

3:48 bottom left

1980: I bet you there are going to be flying cars and a cure for Cancer! 2018: I created the perfect Minesweeper AI.

I lose 99% of my mindsweeper games cause I misclick WAY to much

"generate all possible bomb arrangements" - doesn't that lead to a combinatoric explosion?

Me: The perfect minesweeper AI doesn't exis-. The Video:

You can make a better AI: To make choices of equal risk: (like the first few moves) have it prioritize the move that will give it the *most information* about the rest of the board. I wrote an AI very similar to this one to solve the "Thrill Digger" minigame in Skyward's Sword, and increased it's win rate significantly by giving it this secondary priority. (It had the Third priority of picking the square that netted you the most points in situations where they were equally risky and equally informative; but moves aren't assigned point values in minesweeper)

Maybe it can get better, if by better you mean "completing more games per hour". You can probably optimize and make it faster, but in terms of changing the logic, you could look at situations where it at some point HAS to take a chance, like if there is an island that can't be completed unless you pick a square with less than a 100% chance of not being a bomb. In that case you would be better off taking the chance right away and fail fast if you have to fail at all, rather than putting it off until the last moment.

What if you _combined_ hard-coded rules *with* neural networks and genetic algorithms, not only so that it can never lose on increasingly large boards, but also play at an increasingly faster pace. So it wouldn't just be a perfect Minesweeper player, but a Minesweeper _speedrunner._ One useful technique to teach it would be "1.5-clicking" as well as some no-flags techniques. And maybe throw some raycasting in there just for the sake of over-engineering it~

Funny story. All the way into my teenage years, I didn't know how to play minesweeper; I didn't know what the numbers were for. I just thought it was a game where you randomly revealed squares and sometimes there were mines underneath. I hated it since I thought it was based on pure luck and was practically unwinnable... One day it hit me that I might have a few misconceptions about the game, and I was able to logic out how to actually play it.

You should have added more bombs.

You should revisit this. Room for improvement include having the ai focus on one area at a time to reduce travel time and the utilizing the double click trick: if you left click and right click at the same time on a number that has all its bombs flagged it clears all remaining squares that are touching it.

it's really really good but it's not perfect. the first move shouldn't be completely random, even though all the squares have the same probability of containing a bomb. The corner for example would be a bad move, because in the case that it isnt a bomb, you wouldn't gain as much information about other squares. I imagine that similar but more complicated decisions issues would exist once the game is in progress where multiple squares both have equal probability of being a bomb, but one would give you more information, and therefore give you a higher probability of winning the game. it's really good though.

Code Bullet: Here's my perfect AI Also Code Bullet : *Gives an hardcoded solver*

Hey Code Bullet, I'd like to hear more about how you calculated the bomb arrangements for the probabilities. I made a Minesweeper AI myself a little while ago (no video, just a personal project) and I found that part to be extremely difficult, especially considering that the number of arrangements can reach into the hundreds of thousands even on a normal expert level board. I'm curious if our methods of solving that problem are similar since the math can get kinda tricky.

Who’s talking to me through the washing machine

Sometines Minesweeper generates maps which just can't be solved with all of these rules. So your AI would just rely solely on probability. I'd recommend adding another rule: If we solved everything that we were 100% sure in and now we're left with space which can't be solved with our rules => calculate where the bombs that are left have to be. We got the exact number of bombs left and the "unsolvable" space. Yea, in some cases even this wouldn't work, but solvability percentage will rise and the AI will be even more PERFECT. P.S. well... it would be kinda hard to implement this I guess...

jeez, coming back to OG code bullet is a trip.

Maybe a revised version might help soldiers in the field... Or not...

Title should be "I created a minesweeper algorithm."

I think your algorithm is not perfect since whenever it has to take a chance it should take into account the value of information of uncovering a square so that the risk is "worth it". E.g. in the first move all squares are valued equally but the center might have a higher value of information than a corner.

It’s 3:00 am. Who needs sleep when I can listen to that soothing voice.

4:47 is when it starts.

Look: You need to tell the code how many bombs there are. Then you give every tile the worth: 1-(nbombs):(ntotalfields) That means when you are in a 50:50 situation the bot just skips that and goes to another tile so it has the chance to uncover maximum space.

Your Bayesian method is mathematically perfect for one move, but it only minimizes the chance of boom for one turn. The “best”algorithm would minimize it for the sum of all future turns, which may (may not) mean different choice.

Would've been a bit more interesting if for the larger maps there were more bombs, good video!

How to beat Code Bullet’s AI: *Step 1:* Turn off the AI *Step 2:* Activate your AI. *Step 3:* Win.

Awesome stuff! However, I feel like speed could be improved a bit. Sometimes it goes from one place to another for no good reason. If two or more squares have the same (highest) probability, it should go for whichever is the closest to the cursor right now.

I used to play by starting with the lowest density of bombs allowed and increasing by one each time I won a game. I had an excel spreadsheet which did all of the calculations you describe here. My one reason why your game is not perfect: The first move should always be a corner because corners have the greatest chance of having zero bombs and allowing you to start your actual logic. Sometimes the second, third, and fourth moves should also be corners depending on the density of bombs and outcomes of previous moves. Sides also preferable to random squares for the same reason. All that said, when you get a very dense board, there is nothing like clicking somewhere at random and seeing an 8.

Anyone else watching because they miss his videos?

I don't think so... I see little issue... The problem is that the first move is random and if there is number '1' chance that you click at the bomb is 1:8, but chance that bomb is any where else is (30*16-1)/99:1 = about 1:4,48 that means its safer to click any where around the '1' but your AI had '1', but then clicked randomly else. My math is correct only if I consider that you use standrart Expert mode 30×16 with 99 mines. (I might be wrong just please someone tell me something) sorry for gramma and I love your videos :)

Making a perfect ai is easy Just make it so it can see all of the mines

It's funny how many people here claim that this is not an AI algorithm. But the fact is that search Algorithms which use heuristics like A* are already called AIs. This program is clearly not machine learning, a minmax-Algorithm, a sat-solver or a neural network but even those are just fields of the discipline which is called AI. The only reason why I would disagree with that being an AI - if I had to (which alot of peope seem to do, lol) - is that it is very specialized and doesn't use a general AI algorithm. This weak argument is the strongest argument against that being an AI. So why disagree?

4:47 is where it begins

You could speed this up by having the AI finish a section before making a big mouse movement to a different section in the field. You could achieve this by taking the product of (-2 * abs(0.50 - the probability of this square being a bomb) + 1) and (the distance the cursor has to travel), and then travel to the smallest product of all calculated squares. This will minimize travel time

I'd be curious to see what this AI looks like playing non-euclidean minesweeper or even just minesweeper on weird topologies; n-dimensional minesweeper algorithms would be cool too.

A minor fix: prioritize marking fields by % and then by proximity to previously opened field to avoid unnecessary jumps all over the place.

How does the AI deal with a 50/50 scenario where you're down to 1 bomb, and it could be in either of the final two untouched squares?

you could improve solving time by having the ai chose the tile closer to its cursor if multiple tiles have the same 0% chance of being a bomb (maybe by making your evaluation algorythm starting to calculate the probabilities around the just clicked tile) currently it often clicks a tile then moves somewhere far away then come back for the next move. And afaik the winning method is to be the fastest so that does seem like a bad behaviour for a "perfect" ai.

Does the AI operate at the speed shown in the videos? Truth be told, I'd pay money for a screensaver that featured your AI playing mind sweeper... and I haven't really used screensavers for several decades.

Who is watching this in 2020/2021

lmao that audio quality. I'm glad it's here for prosperity, and I'm glad his mic improved over the years.

I believe this is still not perfect. In the lategame when you have to start clicking squares with a more than 0% chance of being a bomb, you're better off picking a square with a higher probability of being a bomb if it gives you more information about the rest of the bombs, rather than a lower probability square that gives you very little information. Consider a case where you can either take one 50% chance to solve a whole area, or two 33.3% chances. You're mathematically better off taking the single 50% chance than the two 33.3% chances, which is a 44.4% chance of living.

I picture the Super Saiyan 3 transformation dialogue going on during the end "crushing." :) And this is to go even further beyond!

@Code Bullet Clicking on a safest square is a good strategy, but it is far from perfect. You need to make a click which maximizes your chances of winning, not just minimizes chances of instant death. This is harder but gives a better result (and more fun). Example: you have a positions with only one bomb and three remaining squares. One square is completely surrounded by bombs and two others surrounded by bombs together. Which square you need to click? Your algorithm says it does not matter - the chances of bomb being on any square is the same (1/3). But it DOES matter. If you click on a single square your chances of winning is 2/3*1/2=1/3 (you can die instantly or, if you survive, you will have to guess second time with 1 bomb on two remaining squares). But if you click on one of adjoined squares your chances of winning is 2/3 (you will either die instantly, or win, since your move will reveal the remaining bomb location). Hate to bring you down to earth, pal, but you still not reached a perfection :) PS. Creating a good mineweeper strategy with the goal of maximizing the chances of winning is interesting enough task, worth the usage of Machine Learning (brute-force probabilistic approach may be impossible due to combinatorial explosion in the strategical plannig process). But i think creating strategy which emulates what expert human players do is even more interesting. Humans play to get the best possible time, and they can abandon game if beginning is not looking promising. I'd say we limit a total number of clicks which our algoritm can do in evaluation session (but still enough to play about hundred average games) and the target metric should be something like minimal number of clicks in succesful game (our algorithm can abandon the game at any time if it will decide that continuing it is counter-productive). Now THAT is an interesting challenge!

Today: A.I. becomes a perfect Minesweeper. Tomorrow: A.I. becomes a perfect *_Populationsweeper_*

Code Bullet was actually playing minesweeper because you can see the mouse

You should make it so that it doesn't flag the bombs, but just remembers it to save time.

That was mine blowing.......

Very cool. If love to see it deal with a field with a larger ratio of bombs. I wonder at what point the odds of it losing become greater than the odds of it winning.

Now go claim the 1M dollar prize offered by the Clay Mathematics Institute (well if you can find a P solution)

The only way to make it better would be to figure out how the computer generates the field and use what has been solved to solve the random chance bits

I love minesweeper! It's my favorite video game. You could say I'm a gamer.

Plain old coding is not an "AI" it's an algorithm.

First time play showing: *loses* Bot:BUT I AM PERFECT!!!!

A piece of code: Coding Bullet: "Look, an AI"

Finally my uncle who is bored with his office job every 1 hour before leaving hour can now see the end of minesweeper

6:12 It missed a spot. Top-left corner. ;P Then again, the only way to know if that's a bomb is to clear the rest of the field and count the bombs, but since the game didn't give a 'win' screen, it was probably safe lol.

It's so weird not seeing the talking tv head man.

Planning a vacation in Europe be like: *Europe-shaped minesweeper grid*

he's come a ling way with his animations

Loved it ! But you could improve its speed if you could make it move the cursor a bit less

The numbers looked so nice. I always thought that how many big numbers you can get. Kind of like a lottery.

I don't think your strategy is sufficient, since correctly guessing that a square does not have a bomb doesn't mean one wins the game. If one square has a 2/5 chance of containing a bomb, but correctly guessing it would guarantee victory, while another square has a 1/5 chance of containing a bomb, but correctly guessing it would still leave one with a 50-50 guess, optimal strategy should favor picking the first since it would yield a 60% chance of victory, vs. 40% for picking the second.

Bruh you forgot to update the "skip to ???"

Jokes on your AI, i beat minesweeper with 3 moves in 0 seconds

If you wanted to make the bot more accurate give it a better chance then 50/50 by taking the remaining squares that have not been flagged as bombs vs the number of bombs there are almost always more safe squares than there are bombs remaining. By selecting a random square discluding the ones that are known to be 50/50 situations. You can drastically increase the probability of hitting a numbered square which depending on the number the square you select ends up being will still likely have a higher percent chance of being attached to a safe square if it doesn't you go back to the random option.

Dear ai children, This is where our grandad was born

How does the probability method work exactly? It still seems like you would have to implement logic to get it to choose the right boxes.

Plot twist: He programmed it so he can get past a mine field to get to area 51 and get the aliens

0:38 dang cell not only stole piccolos regeneration, but his minesweeper app as well

It seems like the only thing holding your algorithm back is the speed of the mouse. Maybe figure out a way to remove that factor from the equation, or simply increase the speed of the mouse pointer in your settings. If that makes it faster, could you upload a video of the updated version for some extra orgasmic fast minesweeper wins? PS: nice video.

But whats his name? The name of our hero?😯

6:10 I could just imagine him also coding in the minesweeper to play an "oooooooooh" sound as it moved the mouse across to the final corner.

Save time by not flagging the mines, you don't need to. I never bother(ed) on the smallest grid.

There such a dramatic difference between code bullet's older videos and newer videos lol