[dead]
enclose.horse
121–130 of 242 posts
Re: enclose.horse
#122This is nice, I enjoyed it. Was a couple points off the optimal score for day 8 but when I clicked "Show optimal" I couldn't then go back to see mine to compare. Either way, stretched the brain a bit. Only nit: fix the walls. They take up one and a half spaces so are confusing, and they're sci-fi steel with flashing red lights. Turn them into one-square-only fences. You use fences to enclose horses, not raptor walls…
I mean, the horse does sometimes talk about the demon god if you click on it, so who knows...
Re: enclose.horse
#123I'm pretty sure the author got the domain first and then designed an (awesome) game around it.
Re: enclose.horse
#124Earlier quoted context omitted.
The site uses Answer Set Programming with the Clingo engine to compute the optimal solutions for smaller grids. Maximizing grids like this is probably NP-hard. Note that traditional SAT and SMT solvers are quite inefficient at computing flood-fills. The ASP specifications it uses to compute optimal solutions are surprisingly short and readable, and look like: #const budget=11. horse(4,4). cell(0,0). boundary(0,0). ce…
Im over 35 years of age. I have 15+ years of programming experience. And I generally consider myself as someone who has good breadth of tech in general. Yet, this is the first time in my life I've heard of ASP. And gosh. I was completely blown away by this as I read more about it and went through some examples ( https://github.com/domoritz/clingo-wasm/blob/main/examples/e... ) Therefore, like a good little llm bitch…
Has to be my favourite comment, haha!
Re: enclose.horse
#125Great game, I love it! I hope the author is collecting juicy analytics. They would be useful if they ever want to bundle 100 levels in order of difficulty and release this as a Steam game (which I would absolutely buy!) I don’t think the gates should animate up into the air. It breaks the visual logic of 2D for no benefit. It’s subconsciously confusing to see a gate I place in one cell move to occupy pixels in the ce…
And of course: Buy additional walls using in-game purchases!
(jk)
Re: enclose.horse
#126Earlier quoted context omitted.
Reminds me of a comic I saw a couple years back about a horse parliament where the horses only voted “neigh”
That's from the Far Side. My mom has had this on her fridge for at least 30 years.
This appears to be it. :)
https://i.pinimg.com/736x/4f/51/e0/4f51e04263a89a008e29668b7...
Re: enclose.horse
#127Earlier quoted context omitted.
Collecting analytics like this is effectively the same as play-testing physical board games in-development. People play a game, information is gathered, and the game is tuned in response to that. If zero information were ever gathered, games could not be balanced or tuned for other things like unforeseen problems. Please, show me a piece of software, or game, that is perfect the first time it is made.
It's effectively the same, except people volunteer or are paid to play test. This whole industry really needs a lesson on consent.
So long as personal information is not collected, consent is not morally necessary.
If I collect information on how often a coin-op Street Fighter II game is played in an arcade, while collecting no personal information, consent is not needed.
Re: enclose.horse
#128Earlier quoted context omitted.
Side by side or a diff view would be great.
I agree. Also, knowing the max score in advance would be better, so you know when to stop/whether to keep going.
I'm happy not knowing myself but the answer can be found easily in DevTools. All the max scores are there (for current and previous days only).
Re: enclose.horse
#129Earlier quoted context omitted.
It's effectively the same, except people volunteer or are paid to play test. This whole industry really needs a lesson on consent.
So long as personal information is not collected, consent is not morally necessary. If I collect information on how often a coin-op Street Fighter II game is played in an arcade, while collecting no personal information, consent is not needed.
Because using someone else's hardware in a public space is clearly equivalent to using your own hardware in the privacy of your own home.
Re: enclose.horse
#130Earlier quoted context omitted.
Yes. CP SAT crunches through it in no time, but of course larger grids would quickly make it take much longer. See https://gist.github.com/Macuyiko/86299dc120478fdff529cab386f...
I don't believe this works in general. If you have a set of tiles that connect to neither the horse nor to an exit, they can still keep each other reachable in this formulation.
Yes, this is the major challenge with solving them with SAT. You can make your solver check and reject these horseless pockets (incrementally rejecting solutions with new clauses), which might be the easiest method, since you might need iteration for maximizing anyways (bare SAT doesn't do "maximize"). To correctly track the flood-fill flow from the horse, you generally need a constraint like reachable(x,y,t) = reachable(nx,ny,t-1) ^ walkable(x,y), and reachable(x,y,0)=is_horse_cell, which adds N^2 additional variables to each cell.
You can more precisely track flows and do maximization with ILP, but that often loses conflict-driven clause learning advantages.