During the years 2020, 2021, and partially 2022, the COVID-19 virus ran rampant across the globe, causing devastating effects on the masses. Using data mining techniques, we explored factors linked to severe cases of COVID-19 and tried to identify the effect of different government policies on the evolution of the severity of infections. Four countries were selected with a date range of the year 2021 to investigate each region’s efforts regarding vaccine distribution and specific policies enacted for COVID-19 suppression. Pearson’s Correlation Coefficients were used to help establish initially relationships between the policies, vaccines, and severe cases. We used the identified factors to predict the number of new COVID-19 cases and hospital ICU admissions. We included all the country data from Our World in Data (OWID) for this phase. Our investigation indicates that, given enough data, long-range trend predictions can be obtained using Random Forest Regressors. A trained Random Forest model can readily explain factors that effectively slow the spread of COVID-19. With proposed policies given as input, the model can return the expected number of cases, thus informing policies without spending multiple weeks tracking results.

Fun, as a game trait, is challenging to evaluate. Previous research explores game arc and game refinement to improve the quality of games. Fun, for some players, is having an even chance to win while executing their strategy. To explore this, we build boards for the game Ticket to Ride while optimizing for a given win rate between four AI agents. These agents execute popular strategies human players use: one-step thinking, long route exploitation, route focus, and destination hungry strategies. We create the underlying graph of a map by connecting several planar bipartite graphs. To build the map, we use a multiple phase design, with each phase implementing several simplified Monte Carlo Tree Search components. Within a phase, the components communicate with each other passively. The experiments show that the proposed approach results in improvements over randomly generated graphs and maps.

We investigated Parameterized Poker Squares to approximate an optimal game playing agent. We organized our inquiry along three dimensions: partial hand representation, search algorithms, and partial hand utility learning. For each dimension we implemented and evaluated several designs, among which we selected the best strategies to use for BeeMo, our final product. BeeMo uses a parallel flat Monte-Carlo search. The search is guided by a heuristic based on hand patterns utilities, which are learned through an iterative improvement method involving Monte-Carlo simulations and optimized greedy search.