Timeline for Turn Based AI Algorithm (Small Board, Two Steps)
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2016 at 14:03 | answer | added | Karel Tejnora | timeline score: -1 | |
| Dec 15, 2016 at 11:37 | comment | added | user60245 | I understand and appreciate this. | |
| Dec 14, 2016 at 16:58 | comment | added | Philipp | I would if I could remember how that problem was called so I could look up how it is usually solved. I don't write incomplete answers. | |
| Dec 14, 2016 at 16:54 | comment | added | user60245 | Thanks. Would you mind to elaborate on this, maybe in an answer? :) | |
| Dec 14, 2016 at 16:10 | comment | added | Philipp | Your first step would be to calculate all possible moves for each AI unit without regard for other AI units, rate each move by tactical and strategic considerations and order them by rating so you got a first, second, third etc. choice per unit. Then you need to find the solution with the best overall happiness. I am pretty sure that this last step is a quite well-researched optimization problem in computer science. I just can't remember how it was called. | |
| Dec 14, 2016 at 15:21 | history | asked | user60245 | CC BY-SA 3.0 |