@TheBestOne I tried in chrome (for linux) and it worked well. Not sure what just happened. But note that if you close the game, the bot will stop even if you opened it again.
Largest palindrome product of n-digit integers
An integer is a palindrome if its value doesn't change when the digits are reversed. Examples of palindromes are 11, 202, and 1234321.
Task: Write a program or function to find the largest palindromic integer p such that p is the product of two n-d...
Could folks take a look at meta.codegolf.stackexchange.com/questions/4954/… . I've finished the controller and the spec. Please point out any confusing bits/questions/concerns/etc. After a few more controller tests I expect to post it later today.
The bot is obviously not optimal in private beta. I can fix it but unless I just add a special case, it is likely to introduce more bugs and I don't have 200+reps to test it. 1 day doesn't worth much, just a bit frustrating in case there is still human playing it
@user23013 Is the strategy to choose the worst possible action so flags have to be used until a system restart is needed? It's slow, but follower bots will not avoid helping these malicious bots...
@Optimizer Well, it is easy, because new users can vote, they can just register 20 users to take over the control, and we register 40 users to defend. That sounds too stupid and worthless and in case it can really happen, I think no one will really want to defend at all.
When I saw people are raiding other sites here, I thought bots are inevitable. Otherwise we just lose interest in a certain point and do something else
@Optimizer yes, but it took a while for PCG to devise a great algorithm that's united and plays well, and during the time of development many extremists blew the game by restarting like 5 times
What ^ @Geobits said. There's even a bot that generates piano music now.
someone even made a 2147483648, and I found its real objective is to fill the board where people think they will lose. but looks like it has changed later
@Runer112 Well, that's just another point. Nobody else can confirm how anyone else is doing, while it is not the case in other games when most things they say would be probably about the strategy, etc. And in those games, probably nobody really cares whether other people are lying.
Problem:
I get a lot of people dressed and when I do most of them wear belts. I usually have to put the belts on myself, but my arm span sometimes doesn't cover their waist so I have to dodge around them. This opens me to have to be very close them(which isn't a problem most of the time). I hav...
I'm not saying who is lying or not. But they are games anyway. If even debating how good someone can do becomes important, I can't expect there are many real fun parts in it.
Not in mine, at least. APL code boxes used to be almost correct on my Linux Mint, and utterly horrible on any Windows machine I tried. At least there's some improvement.
@Doorknob I petition the un-deletion of the Pixel Battlebots meta question, because there is no other easy way to test answers before posting them to the real challenge.
Something something remainder of dividing by K vs L? But that seems just as naive to me. SO basically I gave up and didn't suggest anything :P
Calculate for each index how many hits of K each one needs to be <= 0 and hits of L each one needs, figure out the realistic scenarios and pick the minimum? :P
In code-golf, are solutions allowed that have an incredibly long, but provably finite computation time?
Of course assuming the question does not specifically rule those out?
Largest palindrome product of n-digit integers
An integer is a palindrome if its value doesn't change when the digits are reversed. Examples of palindromes are 11, 202, and 1234321.
Task: Write a program or function to find the largest palindromic integer p such that p is the product of two n-d...
Problem:
I get a lot of people dressed and when I do most of them wear belts. I usually have to put the belts on myself, but my arm span sometimes doesn't cover their waist so I have to dodge around them. This opens me to have to be very close them(which isn't a problem most of the time). I hav...
In code-golf, are solutions allowed that have an incredibly long, but provably finite computation time?
Of course assuming the question does not specifically rule those out?
