I have added demo videos to all the iOS card games on https://patience.c3.cx/. If you saw them and wondered what on earth all the different games were like, you can now have a quick look! If you didn't, go look now!
They are all in beta on TestFlight for now. Real release will be coming Soon. Try them out for free before that!
Noctilucent clouds tonight.
@vurpo okay all whitefish should be banned EXCEPT if it's two kilos and freshly ice fished
Trying to figure out how to make good looking preview videos for https://patience.c3.cx/
And I think for now my favourite track is _Card Declined_: https://www.youtube.com/watch?v=ozXlmYzF3JM
Out of context it may seem pretty shallow, but it with the all of the context of this album and others it has some layers. And the titular "card declined" line works so well.
Well, having finished listening to it, there sure is a lot going on there. I honestly don't know if I'll listen to this much again. And that is absolutely not saying it's not a good album, it definitely is. But is it an album you want to listen to again? I'm not sure. I guess I'll find out.
At least she got to make a happy song about being friends with A.G. Cook. That is so much better than having to write a song about being friends with SOPHIE.
What I am finally listening to today: Charli XCX's new album _Music, Fashion, Film_:
https://www.youtube.com/watch?v=ox1Eemj8FDo&list=PL-2HG0C5jJQGy2NfRyQZ9HqEV4nG_0WWj&index=2
I was putting this off because it was clear from the released singles that Charli was really Doing A Thing, and I wasn't sure if it was a Thing I was going to be able to figure out how to enjoy.
But it is also started to feel like maybe that was part of the experience. So I am listening now. Still working on figuring it out, though.
boubas delivery service
A generalized desire to understand how the objects and systems around you work, regardless of whether or not that knowledge can actually be applied
So it turns out the correct way to think of it is: Game states and moves can be thought of as nodes and edges in a directed graph. However, what is interesting is not individual states, but strongly connected components of this graph. Each strongly connected component represents a set of states that can easily move to each other, so they are functionally a single state.
Instead of finding out if there is a single available game state left, we find out if there is a single component left.
The actual problem being solved being: Is a solitaire-like game lost? This turns out to be a pretty throny problem to solve. It's easy to see when there are no more moves available to make, but the tricky part is that you might have moves you can still make but they do not progress the game. And you also do not want to reveal to the player that they have no path to success too early, because that is just unsatisfying.
Ended up with this little code to do it. Much cleaner than earlier attempts to solve this problem.
I think I figured it out: I can use https://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm, and exit early the first time it triggers the case to create a new strongly connected component. What I am looking for is graphs that have a single strongly connected component with the root at the starting node.
The expected nature of the graph is such that if the graph is complex, a counter-example should be easy to find, and if there is no counter-example, the graph should be fairly simple.
I need an algorithm. Given: a dynamically generated graph (you have to visit a node to calculate the list of its neighbours, at a cost), and a starting node, I want to find out:
* Whether every node can reach this starting node.
* With an early exit as soon as a counter-example is found, optimised for finding the counter-example as soon as possible (for instance, a dead end is an easy early exit).
* With a limit on the complexity, IE, if it takes too long to calculate, give up.
Any ideas?
Remember urban legends? That used to be a thing.
Can do transitions too.
The code that generated this video:
