@theorytoe@Aether Rember that coding challenge? Muse Spark failed. After multiple tries. With screenshots and debugging capabilities. Muse spark scores 62 on aa coding index. Opus 5 has 68.
@Aether you know, I am generally really pro AI, pro vibe-coding even. I like it, it's fun, it's useful.
But I am getting really tired of this >LLMs have gotten very good at generating code They have? Show me. Show me the good code they produce. Show me the before. Explain the problem. Show me their solution. Because from where I'm standing, I'm seeing people produce 2 pages of text for a skill that explicitly explains to these "smarter than a PhD" systems that they should check if this functionality is in the std lib or an existing dependency, instead of reinventing the wheel.
And whenever I peer under the hood in my projects, I have no fucking idea what any of the code is supposed to do. There's comments everywhere that tell me nothing. And it doesn't do it anyways.
@bajax@theorytoe right direction. hints: you have a grid[x][y] for the ids already you don't need to return the grid lines where you would draw a border, you can just draw a line to the screen at the position you want it.
@theorytoe >the goal is to take grouped squares this is what you keep getting wrong lol you think there are islands of squares and you have to outline them that's far more complicated than what the actual task is
@theorytoe it's very very insightful for me because it tells me what I suspect every single day of my life: Nobody ever understands what the fuck I'm saying.
I'm making a version for you to play around with right now. JS though, sorry. challenge said "common, but unfamiliar language" :)
@theorytoe yes it would look like that and id_loc[x][y] == 0 means unoccupied
Interesting that you think the problem is this complicated to solve. Or I didn't explain clearly, or am misunderstanding your solution because it is too elegant for my grugdev brain.
"border" = " a line drawn on a grid edge. There is no requirement to do this in one drawing operation or anything like that. The end result is all that counts.
There's just two requirements: there must be a line around the area as a whole ( "draw a border around the data structure") and there must be a line on the grid edge between adjacent squares if they are neither siblings nor parent/child.
Like I said, I might be misunderstanding, but scanning an entire row or column and deriving some information from that is not necessary for this.
The fact that you think it's something more complicated makes me question if that was perhaps the issue for the AI as well
@theorytoe Because you know how to ask questions, you would obviously find this information in the codebase very easily.
>group these datastructures based on if the squares share a common ancestor? not quite. there is one single data structure and this is drawn to the screen as squares. This area is always contiguous and has no holes. They occupy an area of the grid. one cell ("square) per node. Each square (node in the data structure) has an id an a parentid. you are supposed to draw a border around the structure as a whole, and on the edges between squares that are neither siblings nor parent/child.
>i would assume each object has positional data yes it does. every square has a grid position x and y. an array[x][y] stores the id at that position even if that wasn't there, that only changes how much of a pita it would be to get the data you need to check for borders, but not the nature of the problem.
@theorytoe I would have placed max turns implementation at the harness layer but idk I think it's loop prevention, mostly. Could instead be caught with something like 10x tool call w/ errors