![]() ![]() ![]() But since patternsearch does not support integer constraints, I need to evaluate it on every combination of integers and then pick the best from Patternsearch is a direct search method that is often recommended over ga by Alan, who's a genius. However, genetic algorithms don't always hold up well in as many dimensions as we Theįirst function that jumps out is ga since this allows integer constraints. Thus I need to take a global approach to this. Since the actual engineįor this app is a black box to me, I am assuming that the score function is highly nonlinear with lots of local minima. ![]() Looking at the tunable parameters there are quite a few and many of them are integer constrained. After a bit of twiddling I was able to! Byīut then I wondered what kind of score I could get with an optimizer from the Optimization Toolbox or the Global Optimization Toolbox?įortunately with the way John wrote this, I could tie into the scoring engine by emulating the output of user selections from A few weeks ago when Will picked Wing Designer I immediately had to go download it and try to beat his high score of 29252. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |