Skip to main content

Indie game storeFree gamesFun gamesHorror games
Game developmentAssetsComics
SalesBundles
Jobs
TagsGame Engines

T216

4
Posts
A member registered 14 days ago

Recent community posts

This feels like a mechanic with so many edge cases. Like you can put it in 3 dimensions to get a really cursed sausagelike

At this point it can still be cheesed, because e.g. the game incorrectly allows N(L,N(L,L)) to predate N(L,N(N(L,L))), where N is an inner node and L is a leaf. I think the correct inf-embedding allows for embeddings with gaps as long as the order of tree nodes is preserved, but now the game only checks for contiguous subtrees, which is strictly stronger.

The correct embedding checking should be easy to implement, but to check embedding of T into S, each branching node in T will create a possibility of permutation, together with all the backtracking, I guess will blow up the complexity?

(3 edits)

Yeah totally 馃槅 But seriously, it's great seeing developers exploring edge cases of their mechanics and embrace them as novel gameplay ideas. Portal paradox, time loop shenanigans, infinite enter, funny wormhole moves... Possibilities are truly endless

I immediately think of the "continuum destroyed" experience from last year's Round Trip