Wins quarterfinal vs. The Iceman, advancing to semifinals
As this report was being prepared, Austria’s Mario He, defeated the “Iceman” Mika Immonen 150-105 in one of the International Straight Pool Open’s quarterfinals. As the defending champion of the Open title, he will play either Max Eberle or Thorsten Hohmann in one of the event semifinals, scheduled for 3 p.m. today. Mario He’s countryman, Max Lechner, downed Lee Vann Corteza in one of the other quarterfinals 150-103 and will play either Denis Grabe or Jan Van Lierop in the other semifinal.
The 42 original entrants in the International Straight Pool Open (formerly Peter Burrow’s American 14.1 Straight Pool Championship) began their quest for the 2024 title on Saturday (Nov. 23). Six competitors in seven groups (‘flights’) began that quest with a round robin phase, setting out in races to 150 (one point per ball) to play five games against the opponents in their flight, which took until last night (Mon., Nov. 25) to complete. When those 105 matches (six competitors x five matches per flight x seven flights) were done, an analysis of win/loss records for each of the flights advanced two competitors with the best records to a 16-player bracket. Two ‘wild card’ selections (the best two, based on a comparison of point-differentials between a player and his five opponents in the round robin phase) were added to the 14 who advanced automatically. That group, now racing to 150, began their final push of seven matches, beginning with four of them which started at noon, leading to a final, scheduled for this evening (Tues.) at 7 p.m.
It’s impractical to start reporting on the 15 matches in each flight to track the progress of each of the two competitors (and possibly a ‘wild card’) that would end up comprising the Final 16. It is, though, significant to note which of the Final 16 made it to that point without losing a match in the round robin phase. There could only be one undefeated competitor in each group.
There were five altogether, representing four different countries; the Philippines’ Lee Van Corteza, The Netherland’s Neils Feijen and Jan Van Lierop, Estonia’s Denis Grabe and Canada’s John Morra. Of those five, it was Vann Corteza who advanced with the highest point differential between his combined, five-match, round robin score and that of his opponents (625-115). The next highest differential, by 114 points (balls), belonged to Morra.
The next group to advance (five down, 11 to go) were the winners of four of their round robin matches; Carlo Biado, Pijus Labutis, Max Eberle, Albin Ouschan, Shane Van Boening, Wiktor Zielinski, Max Lechner, Thorsten Hohmann, and Mika Immonen. The two remaining players who advanced as ‘wild cards’ finished their round robin phases with 3-2 scores; Anthony Meglino and Mario He.
By late last night (Monday), those 16 had been reduced to eight, whose matches began at noon today, with the “Iceman” (Mika Immonen) squared off against Mario He in the Aramith Simonis TV Arena (as noted above, He has won that match). Scheduled on tables just outside the Arena were Lee Vann Corteza against Max Lechner, Jan Van Leirop facing Denis Grabe and “The Hitman” (Thorsten Hohmann) battling Max Eberle. Highlights of that opening round included matches that eliminated Shane Van Boening (versus The “Iceman” 150-113), Anthony Meglino (by Corteza 150-92), John Morra (by Max Eberle 150-13) and Albin Ouschan (by “The Hitman” 150-10).
The four quarterfinal matches will be followed by the two semifinals, scheduled at 3 p.m., with one of them (as yet to be determined) to be featured in the TV Arena. The finals of the 2024 International Straight Pool Open is scheduled for 7 p.m. in the Arena. Depending on when you’re reading this, you can catch what actions remain be linking to the PayPerView option, available through the International Open Web site https://www.intlopen.com/ or through AccuStats directly at https://www.accu-stats.com/.
Mike
I would like to thank you for correcting my math error in my report on the International Straight Pool Open. At first, I couldn't find the error, even after it was pointed out to me. I was stuck on 6 x 5 = 30 x 7 = 210. And then, miracle of miracles, I discovered a lesson I had learned almost 50 years ago in college, but never, in all of the intervening years, had cause to use. I offer the following by way of being an amusing anecdote, not an excuse for the error.
I had taken a college course in computer programming and as a final project, had decided to write a very simple program that would simplify a process in a board game called Rail Baron. The board game was about moving a 'train' from one city to another on a United States map and at the end of one's trip (of which there would be many in the course of the game), you had to consult a printed chart to learn how much money you had earned to make a specific trip. The chart was large and the print very small; one of those charts with a horizontal and vertical axis. Find the city you were in when you began your game 'trip' and then finger along one axis until you located the destination along the opposite axis. At that junction would be the amount you had earned. The print size was so small that it made discovering the amount a challenge. The process was simple enough, it was just hard to read.
All I wanted my program to do when it was launched was to offer me a blinking cursor into which I would type a city name, after which it would offer me a second blinking cursor into which I would type a second name. I would hit 'return' again and the program would give me the answer. No bells, train whistles or graphics, just a written answer.
I had the program figured out all right. It was . . . maybe 10 lines of coding and then came the data entry. I had to input every city on the map and all of the amounts in the handwritten chart into the program, one at a time and in a very specific order. But before I could do that, I consulted with my professor, who explained a very simple and incredible time-saving line into the program, which essentially told the machine that a 'trip' in the game from San Francisco to Boston would yield the same money result as a trip from Boston to San Francisco. It was a single programming line that 'said' that the trip from any City A to any City B equals the amount of a trip from any City B to any City A. It cut my data entry work in half. And when that data entry got underway, I was truly thankful that I didn't have to do the hundreds of individual entries twice.
And that was the mistake I made in my calculations of the number of matches that 42 entrants in the International Straight Pool Open had played in the round robin phase of the tournament. While true that six competitors in each round robin flight played five matches, each one of those matches was repeated in the opponents' calculations; that when Player A played versus Player B, Player B was playing the same match against Player A. So, as you rightfully pointed out, my 'method' counted each match twice.
So again, I appreciate the correction and the opportunity it offered me for the trip down memory lane. It's not a lesson I'm likely to forget twice. Good thing, because if it was going to take another 50 years before I was able to use it again, I'd be long gone.