| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2019-05-14 | Better performance for finding things to shoot at | Justin Worthe | |
| 2019-05-14 | Filled in the rest of the MCTS | Justin Worthe | |
| Problem: The current random things isn't actually finding any victorious end states. This game easily meanders if it's played without purpose. | |||
| 2019-05-13 | Building up unsimulated moves list | Justin Worthe | |
| 2019-05-12 | Outline of MCTS | Justin Worthe | |
| 2019-04-26 | Refactored game map to use less memory | Justin Worthe | |
| 2019-04-25 | Strategy that starts building exhaustive game state tree | Justin Worthe | |
| This falls over (and takes the host machine with it) because its memory usage grows catastrophically. The main use of time, reported by perf, was cloning the map vector. | |||
| 2019-04-25 | Made the state object avoid any heap allocations | Justin Worthe | |
| 2019-04-22 | More minimal game state | Justin Worthe | |
| I'd prefer to start with just the state that I need, and progressively readd the bits that I've skipped as I find I need them, or as the competition evolves. | |||
 |
index : entelect-challenge.git | |
| Bots for various Entelect Challenges | root |
| summaryrefslogtreecommitdiff |