![]() ![]() If you have some filtered version of a list, and the original list has repeated values and one of those values is in the filtered list you may get the index of a value in the original list that you filtered out. If you're trying to do a bunch of filtering and sorting and what not with two or more lists, be very careful when you use the.Making a minimax algorithm or throwing some machine learning for a move-deciding algorithm.Do a bunch of tests to see what kinds of maps lead to draws and for which algorithms.One or two more move-deciding algorithms, specifically one that attacks the weakest neighbor only if they can capture it.Most of the trouble I had was with the algorithms to decide which moves each player makes, specifically the attack_weakest_neighbor function, and that was mostly down to the number of variables I had running around. If you add one point to that graph is there a way to use your previous computation to get a solution to the new graph, or do you have to throw it out and start all over again? And if you can reuse your computation, is there a risk of creating some sort of path dependence where the order of the points you add can lead to poor solutions.Īnyway, the code for this project wasn't too difficult, most of the code is just dealing with the game logic of resolving moves. Say for example you have a solution (either exact or approximate) to the travelling salesman problem. One of the things I want to explore more is what happens when graphs change over time. ![]() Graph theory is one of my favorite areas of math, and looking back on my time studying it most of the graphs in question were static. I decided to make a python version of the game Galcon, which is a casual RTS game about capturing planets, which automatically create units that can be sent to capture more planets. Home One-A-Day 3: Galcon in Python 26 March 02021 ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |