![]() Close matches would still be decided by luck, but it should at least avoid extreme cases such as the one I have experienced. Only without the () there is no error, but it still doesn’t work. Sometimes there was written that item pet.findNearestItem () is written wrong, that I should type in pet.findNearestItem () which was written the same. My suggestion still leaves a small randomness factor such as the coins’ spawn position’s proximity to the hero as well as coin concentration areas. Need help at the lvl 'Long Road' with Python. More specifically from an implementation point of view, coins should be spawned in pairs, both with the same value, one in each side of the map. For example, for each coin the referee spawns, it could spawn a coin with the same value in the opposite side at the same time. So, I would suggest to spawn the same amount of gold in both sides. Then I realized that it could be that I was just on a bad seed, so I re-submitted my code and destroyed the poor AI then. The attached codes are solutions to Code Combat levels and are written in Python. I’ve spent several days optimizing my code and I just couldn’t beat the simple AI no matter what. The main issue I’ve had with this level is that coin spawns seem to be completely random: the referee may spawn way more gold in a player’s side than the other. ![]() 16: 6321: NovemWhat is wrong with my code Python, Sand Snakes. hero.moveXY(30, 13) secret hero.findNearestFriend(). CodeCombat - Coding games to learn Python and JavaScript Move to Laszlo and get the secret number from him. ![]() Related Topics Topic Replies Views Activity Metal Detector - Python. I can’t figure out the code to The Wizard’s Door and this is my code. Sorry to revive this old thread, but it seems like this level hasn’t been published to the general public yet, right? CodeCombat Discourse Metal Detector - Help Needed. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |