Some knowledge about compiler was interesting. The advise to use combined return types (for errors and value) instead of exceptions is ridiculous. Some other points are weird as well. Changing language to avoid null…
Not our problem, if the title is rage baiting and missleading.
Why not interchange ‘Why’ with ‘When’…
If I post: ‘Lemmy communities suck’ as a Youtube video (arguing against someone, who said this), which should not be posted at Lemmy (as it is big tech and full of trackers), I’m the on, who have to live with the consequences.
No, BFS is ment to explore all nodes abd edges systematicaly, while ant algorithms may never explore a whole bunsh of nodes. They do they search not systematically but by walking paths randomly at the beginning and spreading pheromons while doing so. Finding shorter paths will result in a higher pheromon level remaining and thus direct next ants to these shorter paths instead of longer ones.
You wouldn’t know, what they will do before executing the program and they will propably find shorter paths if you use 1000 ants instead of 100.
In my results I drew a graph the highlights the ant’s paths by thicknes. I drew such a graph after (for example) 10, 100 and 1000 ants. You could see, that the first ants took a path randomly and after 100 iterations, some of the shorter edges became a bit thicker than others. At the end, only the shortest edges where drawn with high thickness while the longest one where rarely used if at all
I implemented a self made or at least adapted ant based algorithm to solve a mathematical problem. Each ant walks a route which represents a possible solution. The shortest path is the best solution. It takes advantage of swarm intelligence.
It is compiled into bytecode. A transpiler translates to another programming language with the same level of abstraction. A compiler translates into a level that is nearer to or machine code.
As op is not able to post content of article, making this post useless, I will:
"But do you know what’s better than an emulator? Taking the existing Playstation 2 game and recompiling it to run on a modern platform (such as your Windows or Linux desktop PC). That’s exactly what is being worked on now with PS2Recomp, a static Recompiler & Runtime Tool.
To keep things simple here, this will basically take a Playstation 2 game (which would be designed around the PS2’s unique architecture such as the ‘Emotion Engine’ CPU that’s based around a MIP R5900) and convert it to natively run on whatever platform you’re targeting.
In plain English, this is a tool and obviously, would need to be used on different games. In other words, it’s not just a ‘download and every game automatically runs’ application. But, it will give folks a tool to be able to decompile the game and quite frankly, that’s absolutely incredible.
This is a great stepping stone for some incredible remasters and community remakes of games. There are already HD Texture Packs available for PS2 emulators, as well as other ways to improve visuals. But this would give even more freedom and flexibility to do modify and really enhance the games. That’s to say nothing of totally unlocking the frame rates (and likely not breaking physics or collision detection which is a big problem with emulated titles)."