User Files for Flooder

It's been a while but I've managed to get the script working with the new custom board generator functions. This one is for the first level in the C64 flooder and I've already got a solution down to 7 moves which I think is the lowest possible but I'm testing currently to see if 6 is possible, though I'm doubtful

ok, this one's going to need a bit of an explanation. I found another flooder game https://josipretrobits.itch.io/flooder this time for the C64. The gameplay is identical to the GBC game which this script is written for except it's a level based game with all patterns being preset and the solutions gradually getting harder with the board getting bigger with each level. There's also no limit on the amount of moves that can be made, just as long as you can beat the level, you win. But that's not good enough for a TAS and I want to find the optimal solution for each level. My first thought was to adapt the brute force script for the GBC version for this version, but unfortunately the colour changes are not instantaneous and it takes a million years for the board to change colour one pixel at a time. It also doesn't help that you can only have 10 colours loaded at a time and you have to wait for the game to change colour ten times before you can load the next ten so this isn't a viable solution. Or is it? I've already got a script for the GBC game so why not recreate the C64 game in that game? What an absolutely fool proof solution. This file recreates the first level of the easy mode in the C64 mode by using colours 1-4 and a 6th grey colour to make the empty space.

I'm yet to modify the brute force script to make all pixels turn grey when the board is solved but I've got ideas for that. The C64 game isn't particularly fun to TAS and it takes ages so I haven't made much progress and I haven't actually used this custom pattern script properly yet. The best method I've tried so far to find the fastest solutions is good ol' google sheets (at one point I was using google slides lmao) but I haven't worked on this for weeks and probably won't again but thought it'd be worth uploading anywa

actually wrote this one myself (which explains why it's so bad) and it works exactly as intended. to run, you need to start the game and do the first move yourself, then modify the section inside the first while loop before the second so it can only select neighbouring colours. After that, it should run smoothly and may give you a solution in 10 or so minutes depending on which pattern you choose.

I'm currently working on the second possible pattern and after slimming it down, it's 348 frames long, only 16 longer than my none botted tas I did ages ago. Will see what happens when I optimise this solution further