Leonardo da Pixli
function(myself, grid, bots, gameInfo) {
var ME = this;
var w='up',a='left',s='down',d='right';
var ps = [
[
16,30,0,11,
[s,s,d,s,d,d,w,w,w,w,a,a,d,d,d,w,s,s,s,s,s,d,w,w,s,d,s,s,d,s,s,a,s,a,a,s,a,s,s,a,s,s,s,s,s,s,s,a,a,s,d,w,d,s,d,w,...
but makes sense - it doesn't stay in one place for long at all, it's like the best thing you can make for a bot which doesn't stay in one place for a while :p
@tomsmeding my controller already does games in parallel
and there has been work for node support for that framework I'm using, just that I have no idea how much work would it be to get it to work with my modifications
Yeah, I was too lazy to do the array handling in an smarter way. Or he just feels bad when another bot dies, so he gives the current target a chance to get away.
Dragon has a somewhat slow first turn but goes much faster afterwards because it uses recursive regex replace to generate the dragon curve but only needs to generate it once.
@Alion In my mind it was such a simple challenge, I never thought that the bots would slow until DFS showed up. By that time it was too late to set a time limit
Worst thing about debugging my bot is that I have to restart the entire game basically every time I make a change, because it keeps a lot of historical data that it doesn't/can't recalculate every frame.
And then I have to fast-forward some moves to get where I need him to be again.
Maybe a better way of doing this is not by running for a set number of games, but a set amount of time. So maybe I run the tournament overnight for 8 hours
Unfortunately, game results are not repeatable because Math.random and other sources of non-determinism aren't disallowed, which makes the trust problem worse.
dzaima's controller provides a seed for each game, which you could use to replay that game exactly how it happened the previous time that seed was used.
@BetaDecay if you'd want tomsmeding to run some games for you, you give them a couple seeds which then get run and after you could make sure that a couple of those game results are actually what they should be by testing them (by testing a couple yourself)
@BetaDecay No no no. Not at this point I don't think.
We'd need a community-wide consensus for that.
As for my personal opinion, yeah a slightly smaller grid would be nice. But I know a lot of contestant rely on the grid size quite heavily, so I don't think this should be done without their knowledge and/or consent.
To start with, I think the grid size should scale with the square root of the number of contestants, so that the space per contestant stays the same regardless of the number of contestants.
I mean, I wouldn't be against that, but I don't know if every bot would work fine after a change like that. I remember some bot using bots.length * 3 to test for grid size (which is wrong anyway, but that's not the point).
@dzaima That is important to know. If number of wins is important, I can tune my bot for risky strategies at the end if it is close to top score but isn't at top.
But if average point is important, then keeping the non risky steady movements could work better in long run
Right now with 3 parallel processes running on my PC with all 35+1 bots (35 published bots + my second unpublished bot), each game takes about 7 minutes, so I have a speed of 25 games per hour :-/
It should be a lot better, yours is 7th generation and should not get over-heated easily, mine goes up to 70-80 degrees Celsius which reduces performance a little bit.
I ran a part of a tournament with the current bots on dzaima's controller; the first game to be done (arbitrarily G4) was done after 9 minutes, and after 11.5 minutes the first 5 were done. (While the 2nd to 5th game were finishing, more were already started in parallel.)
@Alion mine is just look at the available 2 cells (or 1) and choose the best one, no thinking ahead. It wouldn't be that bad getting something better but ¯\_(ツ)_/¯
I'm probably missing something huge but wouldn't you just start at the starting corner and just go to the further cells scoring them with your travel cost + its score and taking the minimum where multiple lead to it?
@Alion I'd limit the size search to the bounding box of the start and the target (or maybe a bit more) and stop as soon as the layer with it is finished
@dzaima That entirely depends on the priority of arriving at the destination. If the goal is just some general area to be in rather than a strict action that needs to be taken then one can argue that painting as much space on the way there is a better idea rather than just completely wasting some time.
@Night2 while @BetaDecay should run the tournament as described, there's nothing to stop him, say, giving a bounty to the bot which was the most time efficient or had the best average score, or whatever
@Neil I was mostly joking though. He will already have a hard time running so many games. Not sure if we want to add run time calculations to it as well :P
btw, since DFSBot's score is always positive it should be possible to prune paths early when they can't give a better score than the current known best
@BetaDecay I don't know, I used to get free licenses each year for PHPStorm (which is from same company) for my personal uses with my student email. And it was automated. You can get more info here: jetbrains.com/student
I didn't know what that card was, looked it up, found out the headquarters of the whatever that runs that is based in Amsterdam, while I live in the Netherlands
@BetaDecay You probably should be able to use your email as well, if you look at the first FAQ question, any domains in this repository are accepted: github.com/JetBrains/swot
instead of creating a new board every time you can create just two and copy from the first into the second for each bot, and give that bot the second version
although you would also have to check in case some people changed the size of the board you give them
or replaced some rows with non-array objects or something crazy like that
Leonardo da Pixli
function(myself, grid, bots, gameInfo) {
var ME = this;
var w='up',a='left',s='down',d='right';
var ps = [
[
16,30,0,11,
[s,s,d,s,d,d,w,w,w,w,a,a,d,d,d,w,s,s,s,s,s,d,w,w,s,d,s,s,d,s,s,a,s,a,a,s,a,s,s,a,s,s,s,s,s,s,s,a,a,s,d,w,d,s,d,w,...
ClaimEverything
function (myself, grid, bots, gameInfo) {
let my_c = myself[0], my_x = myself[1], my_y = myself[2], size = grid.length, roundnum = gameInfo[0];
let getDistance = function (x1, y1, x2, y2) {
return (Math.abs(x1 - x2) + Math.abs(y1 -...
Feudal Noble
function (me, board, painters, info) {
let meX = me[1], meY = me[2], round = info[0], size = board.length, sectionSize = Math.ceil(size / 3), storage, storageKey = 'jijdfoadofsdfasz', section;
if (round === 1 || typeof this[storageKey] === 'undefined') {
let bounds ...
