Well I think i just couldn't resist seeing my exas simulating a dfs after all, I love seeing algorithms graphically, and it would solve easily the issue of conflicts over the network. We're imitating a virus, after all, not an intelligence! I don't really "search" in any linear fashion, the spread happens as much "parallel" as possible. I still have my solution, though!ĭfs and bfs are "depth" and "breadth" first search? I just make sure my exa's spread everywhere, in all directions with a lot of REPLs. If I look it up somewhere, maybe, otherwise, I really don't have a clue. Do I have any idea what that means about the resolution time if the data set expands linearly. Do I have any idea what's it called? No, but the name will probably make sense. Is that a (formal) sorting algorithm? Probably. So in my solutions I just solve it pretty straighforward: find the smallest number, copy that, find it again, delete it, rinse, repeat. There is really no great/efficient way to store references within Exapunks. I tried to apply that little tidbit of information to this level: and horribly failed. While if you store "the 3rd number is the biggest", you can just jump there when you need it. It might be the first, it might be the last, it might be somewhere in between and depending where it is, finding will take a long time. If you store "10 is the biggest number", then you still have to find that number later, if you want to delete it. (this was after being interested why others had such better scores than I did) ![]() I remember a similar challenge in the game "Human Resource Machine", there you can actually store references (positions in a file) quite easily, and I learned that it's smarter to store the reference than the value. As someone who has very little knowledge of sorting algorithms (I know they exist, and I know there are different approaches): yes, it's solveable without any formal knowledge.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |