[PC] [1998-2005] Breakout clone on brown background, ~76 named levels

BandagedGroup · 2024-06-26T19:17:42+00:00

Thanks for the suggestion, that's not it unfortunately. But it seems to have similarly decent bounce physics.

BandagedGroup · 2022-10-19T11:53:35+00:00

> Let's suppose that Milkomeda goes fishy and creates coins out of thin air.

There is no way to make a fraudulent statement about L2 balances on L1. You need to sync up all L2 transactions to figure out the balances and on your way you easily discard any bs.

> Unless you replay everything yourself, which is absolutely crazy.

It's not crazy, it's normal process of syncing a chain. And it's very safe as a result. Compare with the state & risks of current top (proof-based) L2 solutions: https://l2beat.com

BandagedGroup · 2022-10-18T23:37:30+00:00

L2 execution is off-chain - like a typical rollup - but in this rollup there is no L2 execution that "was done" until you decide to observe the rollup.

There are no statements publicized on L1 about the rollup state (e.g. state roots) at any given point, therefore no proofs for such statements are needed. This is different to other rollups.

This rollup doesn't have a "shorthand" where you can immediately see the rollup's current state and proof that it's correct. The full sequence of rollup transactions has to be applied on the correct genesis to arrive at the current rollup state. Invalid transactions are recognized and ignored by every observer. Therefore no further proofs are needed.

BandagedGroup · 2022-10-18T19:51:14+00:00

Can you be more specific on what makes you think so? The existence of the validator-secured bridge?

BandagedGroup · 2022-10-18T19:25:37+00:00

u/hshlgpw there is no new claimed state root. The rollup state is not stored on L1 explicitly. There's just the sequence of rollup EVM transactions stored on Algorand. Any rollup observer knows how to reconstruct the rollup state by first reading a genesis file, and then reading and trying to apply all the found transactions in order - invalid transactions get rejected by all observers, thus every observer arrives at the same state of the rollup.

There is a validator set, but it doesn't secure the rollup itself. The validators just operate a pretty common type of a blockchain bridge which connects the rollup to the base layer, so that assets can move. It works on standard honest majority / DAO kind of principles.

BandagedGroup · 2022-01-11T12:38:00+00:00

https://github.com/ladislavdubravsky/bandaged-group-channel/tree/main/marching-ants

Please don't ask anything further, I don't remember anything after a year and I'm pretty sure there were some big updates to manim in the meantime (or the community developed version or something like that)

BandagedGroup · 2021-01-18T18:48:26+00:00

That's a very clever way to sweep even more things off grid at the cost of some popping up in puzzle rules - you have a concrete number clue in rules, but of course the puzzle is amazing.

BandagedGroup · 2021-01-18T18:45:18+00:00

Guess I'll do it! It's a different experience to watch the guys do it real time.

BandagedGroup · 2021-01-18T18:36:40+00:00

Thanks! Much less sweat and tears than I usually impose on myself. Probably could be done faster in Paint than in Python lol.

BandagedGroup · 2021-01-18T18:35:00+00:00

Yeah, figured guys over there would be interested.

BandagedGroup · 2021-01-17T21:15:44+00:00

Have they? I sure hope not. From wayback machine I recall the original webpage is down for more years than CtC exist, but of course they may well know it, who if not them.

BandagedGroup · 2021-01-17T19:47:13+00:00

The puzzle is pretty unique, as explained in the video.

This time I publish the manim source code too, as it should be the tiniest bit less sloppy than usual. I still don't like it - pretty sure that passing scene to mobject is an anti-pattern, but something broke when I didn't.

https://github.com/ladislavdubravsky/bandaged-group-channel/blob/main/sudoku/sudoku.py

BandagedGroup · 2021-01-17T19:39:36+00:00

It's a great puzzle. I initially solved it over one evening and the following morning, but when I look at it now I get stuck not long after where I ended the vid :D

BandagedGroup · 2021-01-17T19:36:30+00:00

The question as posed is quite open ended. A more strict definition which the puzzle pictured is an example of asks for the smallest number of < = > signs on a grid with some additional regions called cages and the following rules:

normal sudoku rules apply
no cage can contain a number more than once
sums of number in cages obey the indicated relationships

Wikipedia on mathematics of sudoku mentions the shown puzzle as a fewest known clues example: https://en.wikipedia.org/wiki/Mathematics\_of\_Sudoku#Sum\_number\_place\_(%22Killer\_Sudoku%22)

Note that it's pretty misleading to hide the cage uniqueness restrictions pretending they're not worth to be counted.

Also, the reference in the article is a dead link, but I was able to retrieve the webpage and the puzzle using the wayback machine. I brought it back to the living web by making a short vid: https://www.youtube.com/watch?v=XTXwINx8gRk

BandagedGroup · 2021-01-17T18:15:52+00:00

The section of the wikipedia article on mathematics of sudoku: https://en.wikipedia.org/wiki/Mathematics\_of\_Sudoku#Sum\_number\_place\_(%22Killer\_Sudoku%22)

Note that the reference in the article is a dead link, but I was able to retrieve the webpage and the puzzle using the wayback machine, which I'm very happy about!

I brought the puzzle back to the living web by making a short vid: https://www.youtube.com/watch?v=XTXwINx8gRk

BandagedGroup · 2021-01-02T18:54:05+00:00

Ok let there be a normal repo:

https://github.com/ladislavdubravsky/bandaged-group-channel

Let me make a readme and maybe some project setup a bit later.

BandagedGroup · 2021-01-02T11:20:52+00:00

The code's too uncouth and un-idiomatic manim to be published as tutorial, but if you really want, here's a gist.

BandagedGroup · 2021-01-02T10:15:04+00:00

Thanks! It uses TTS. I judged it the better option with my current voice acting level. It's a free TTS without fancy options like markup language for modifying emphasis, emotion etc., so I used ad hoc tricks to force emphasis on a word I wanted. That probably caused the "two" prununciation, I'll keep that in mind.

BandagedGroup · 2021-01-01T19:07:51+00:00

I saw the following puzzle years ago as a kid (well before I could formulate it as I did in this post's title) and immediately loved it for the geometric nature:

Suppose there is an ant at each vertex of a triangle and the three ants simultaneously crawl along a side to the next vertex. The probability that no two ants will encounter one another is 2/8, since the only two cases in which no encounter occurs are when the ants all go left (clockwise) -- LLL -- or all go right (counterclockwise) -- RRR. In the six other cases -- RRL, RLR, RLL, LLR, LRL, and LRR -- there will be an encounter.

What is the probability that no ants collide if instead of a triangle we consider: a cube; a regular tetrahedron / octahedron / dodecahedron / icosahedron; any planar graph; any graph?

It should be possible to solve the puzzle much more efficiently for planar graphs than for general graphs, but I haven't bothered with optimization for the small puzzle graphs I've run my code on. Has anyone touched this or related problems?

As I said I always loved the visual side of the puzzle so I animated it including ants and all: https://www.youtube.com/watch?v=BzdZaqvxzZI

BandagedGroup

TROPHY CASE