When you write code in Rust and user your compiler to produce an x86 binary, you don't maintain the binary. If you want to make a change, you toss away the old binary, change your Rust code, and recompile.
not sure what the right game experience would be for that. a notif that says "You can still solve more words but you'll never solve them all!" doesn't quite work here, because it's sort of saying "there's only one _right_ way to win, but good luck figuring out the right order". Still, it would be better than me finding that out at the very end.
it would probably be pretty important to design levels so that the unwinnable states can't happen early in the game, but it's getting a little abstract to think about at this point. sort of brings me back to that unblock it game from the old ipod touch days.
#Uncrossy Jan 8 in 18 moves, in 2:23, no hints, no resets, no undos, auto-hints on ⬅⬅⬅⬆⬅⬅⬆⬇⬆⬇⬅⬇⬆⬇⬅⬇ https://uncrossy.com
It's easy to assume making a word disappear is always the right choice, but you forget it changes the word it leaves behind as well. Very clever.
It does have the same quirk Wordle had that bugged me: Treating browser storage as useful in our multidevice world.
It's also easy to make the opposite assumption, that the goal is to change the other word. I initially felt weird about changing from a letter at position 3 to the same letter at position 1, but eventually realised that the goal is just to slide the word around, not necessarily to make a new word.
Also, the site worked for me in Chrome but doesn't work in Firefox (145.0.2). Do `window.cookieManager = ...` (or even `var cookieManager = ...`) instead of `const cookieManager = ...`. This goes for all variables in the global lexical scope you intend to share across source files.
I didn't like that it's possible to leave the underlying word unchanged by dragging the word containing a letter twice to the second occurence.
The only thing that felt a bit weird was being able to change the word to the same word, if the slid word had the same letter twice.
I actually never came across the situation where my grid was unsolvable. As I was playing I was wondering what kind of algorithm you used to come up with grids that have no possible dead ends. Since this is clearly an issue, I wonder if it's possible to come up with puzzles that always have a solution similar to how the algorithm for creating Sudoku puzzles always guarantees it can be solved without guessing.
"Loading failed for the <script> with source “https://uncrossy.com/js/cookieManager.js”." looks like a false positive in the ad blocker. Allow-listing the site fixed it.
nottheg•3w ago
Haven't yet really tried the full level but really liked the tutorial, and the quality of the build
update - wow the actual level is better ;)