ezchili

@ezchili@iusearchlinux.fyi

• ⁨Comment⁩ on ⁨How long do you think until AI writes and debugs code better than the average programmer?⁩ ⁨⁨11⁩ ⁨months⁩ ago⁩:

  It works

  I think the best option is to make sure to have ‘sorted’ the calls to the fire tiles, you can do that by having them in a separate grid or just stash them to a small local array on stack when you encounter them, and investigate those at the end of the loop

  If there’s no result that’s been found under the cost limit without the fire at each point of the algorithm, you do do the recursive calls for the fire

  Then once you’re back to the top level call, if there was a non-fire path you will get that result, if there wasn’t you will get that instead

• ⁨Comment⁩ on ⁨How long do you think until AI writes and debugs code better than the average programmer?⁩ ⁨⁨11⁩ ⁨months⁩ ago⁩:

  I’ve had 100% failure rate on simple requirements

  “Make a pathfinding function for a 2d grid” - fine

  “Make a pathfinding function for a 2d grid, but we can only move 15 cells at a time” - fails on lesser models, it keeps clinging to pulling you the same A* as the first one

  “Make a pathfinding function for a 2d grid, but we can only move 15 cells at a time, also, some cells are on fire and must be avoided if possible, but if there is no other path possible then you’re allowed to use fire cells as fallback” - Never works

  There for that last one, none of the models give a solution that fits the very simple requirement

• ⁨Comment⁩ on ⁨Angry bald man⁩ ⁨⁨11⁩ ⁨months⁩ ago⁩:

  I’d be absolutely devastated if someone drew me like that as a response to something I said