Mastodon Feed: Post

Mastodon Feed

jonny@neuromatch.social ("jonny (nonvenomous)") wrote:

It had deleted the code in question before I could screenshot it, and i am not exactly practicing git discipline for a slop experiment, but here is a screenshot of the problem and the revised comment the LLM wrote about it in case you think i am making this up.

A graph with two labeled nodes, "over" and "scraping" (the goal of the game is to get from one word to another by replacing segments of the word with other word, not important, will explain the full game later). The graph is haphazardly laid out, and one chain of nodes is highlighted. the first node is on the left side, then the next node in the chain is on the right side, and the third is back on the left. the second node should be nearby to the nodes it is connected to, that is the whole thing a graph layout engine does.
This file used to do a great deal more than that, and the extra was not neutral. Words were assigned Lanes by how far off the answer they were, and a side within the lane by alternating alphabetically down each row - so a word's horizontal position was decided by its spelling and then held there by a force, which is how a word joined to two others ended up across the board from both of them, and how a chain of words each joined only to the next came to zigzag from one edge to the other. There was a frame with walls, and the walls stacked whatever reached them into horizontal lines. All of it is gone. A force layout only works if the forces are the ones the graph