Addy
link (t)wink 
LapisPebble
Bard 
Emily Fox@abstractcow @Bard @link Since I read your profile I can tell you that "Umamusume: Pretty Derby" is about people deluding themselves that they are raising cute anime horse girls when really they are stuck in the cycle of trying to solve the NP problem of setting a schedule and getting the most wins in tournaments with the race horses they currently have while playing the least.
It's no coincidence that this game came out one year after this paper in order to gather more data. https://link.springer.com/article/10.1007/s10479-024-06394-7
It's no coincidence that this game came out one year after this paper in order to gather more data. https://link.springer.com/article/10.1007/s10479-024-06394-7
Modelling and approximate approaches to organising horse race schedules - Annals of Operations Research
In this paper, we study a scheduling problem in horse race organisation. Horse races must be planned using a predefined racing calendar over a given time period to maximise the total number of runners, while satisfying hard constraints based on racing codes and soft constraints for the modelling of potential race sequences. Two metaheuristics guided by a penalty function and using specialised neighbourhoods are implemented and applied to real and artificial instances. The numerical experiments show the effectiveness of the methods compared to a more naïve neighbourhood, a heuristic, and manual planning by human experts. We then propose a compact 0-1 linear programming formulation that simplifies the initial problem and provide a proof of its NP-hardness to highlight the difficulty of the problem we have solved.
@LapisPebble @Bard @link “Since I read your profile:” Wait. Am I about to learn something personal?
Oh no, it really is just nerd stuff.
And not completely unrelated to some of my grad research.
Oh no, it really is just nerd stuff.
And not completely unrelated to some of my grad research.