1b:I[3821,["874","static/chunks/874-5853b36c417a5f43.js","598","static/chunks/598-8e8b350c69b61725.js","735","static/chunks/735-5d5145bb0f79dc16.js","881","static/chunks/881-64080935572a77c4.js","671","static/chunks/app/%5Blocale%5D/submitted/page-9972e6b84e2d7c4f.js"],"default"] 1c:T40b,I had an idea on a competition in a highly constrained environment: 32x32 matrix, with bots running code you write! The live site is https://kingofthegrid.com/.

Each bot emulates Z80 CPU and they all get equal execution time, so the most efficient algorithm wins.

Bots can move, eat, clone themselves, and most importantly, survive the competition.

Each submission, leaderboard is re-calculated, such that each participant has a match against each other, and the bot that makes the most wins gets to the top.

It includes includes an online in-browser IDE: https://kingofthegrid.com/ide/ that way you don't even have to download anything to spitball ideas. After compiling, you can test your code in browser as well.

I am also hoping for submitters to come up with ingenious ideas that would force others to re-think the strategy, etc.1d:T5ef,Out of boredom I've created a competition where the goal is to write the most efficient both to be King Of The Grid.

Code: https://github.com/kingofthegrid/king-of-the-grid

Rules:

* World size: 32x32 cells

* Two bots (or programs) spawn in top-left and bottom-right corners

* Each bot has a set of energy. See rules.cpp for exact values.

* Bots run on Z80 CPU. See CPUs section.

* Walls (obstacles) are generated before each game starts, such as it is guaranteed there is a path between two bots.

* Food (static) and prey (moves) are spawned periodically.

* Food and Walls are not spawned

desertkun 的提交内容

翻译中...

翻译中...