Regular Members
  • Content Count

  • Joined

  • Last visited

Community Reputation

0 Neutral

About SumoLyubo

  • Rank

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

  1. SumoLyubo

    2021 "Kozumo" Hatsu Basho discussion thread

    Yeah they had a different angle in the replay. Probably okay.
  2. SumoLyubo

    2021 "Kozumo" Hatsu Basho discussion thread

    Did anyone else think Hokutofuji didn't have one of his hands down at the tachiai? Frustrating how that's occasionally not enforced.
  3. SumoLyubo

    Theoretical Sumo Tournaments

    Yeah, I'm digging through my old AI textbooks to figure out what would be a good approach. I had not thought about an expert system but that seems very promising.
  4. SumoLyubo

    Theoretical Sumo Tournaments

    I've lurked the Sumo Forum for a while, but now I've found occasion to post. I spent some of my free time last week encoding sumo tournament scheduling as an integer linear programming (ILP) problem, largely as an excuse to play around with an ILP solver but also out of curiosity for figuring out certain theoretical possibilities for sumo tournaments, such as the lowest possible winning score without a tie, the largest possible tie, etc. I have posted my silly tool and written up some results here. Many of these bounds are, in retrospect, not too hard to figure out by hand: For example, if there are 315 total wins in a tournament, then there can be at most 315/8 = 39.375 (round down to 39) top-division wrestlers with a winning score, etc. Nevertheless, it is not obvious (at least to me) how to go from verifying one of these bounds to producing a specific tournament that fulfills those criteria. Note that the tool is pretty slow, so it's probably not a practical way to explore possible sumo tournaments. I am curious as to whether others have worked these out on paper before and whether there are more results of this vein that I never considered. I am really bad with combinatorics, so I am also curious as to whether some of the problems I've stated are instances of "canonical problems" that I'm simply unaware of. This was just a feverish first pass at the scheduling problem (also I don't have much prior experience with ILP solvers so I may just be encoding it badly), so I am also interested in extending or improving this solver. One thing I am curious about is whether trying to encode the typical scheduling customs (yokozuna and ozeki facing the komusubi and top maegashira in week 1 and then the sekiwake and each other in week 2, etc) might actually improve the performance of the solver, as it may reduce the search space. I would be curious if there are neat formulations of these rules I could try passing to the solver, either as hard constraints ("a yokozuna will never face M17E unless they're tied for the lead," etc) or soft ones ("minimize the distance in rank between the fighters in each bout"), that also seem realistic. Another problem I would like to consider is sampling likely tournaments (schedules and outcomes), but I haven't worked out how to do it. A practical application of such a tool would be if one could judge the probability of a particular tournament as it unfolds. I'm curious if others have written up tools like that, as I'm sure someone's tried before.