In a tight defensive struggle, Chrisman's punts forced Michigan State (6-4, 4-3 Big Ten, No. 18 CFP) to start its first five drives after halftime from its own 5, 6, 3, 1 and 2-yard line. On the fourth of those possessions, the Spartans took an intentional safety instead of punting out of their own end zone. That decision gave Ohio State a 9-6 lead but wasn't enough to flip the field position.

Although researchers have studied which factors influence the behavior of traditional search algorithms, currently not much is known about how domain properties influence the performance of real-time search algorithms. In this paper we demonstrate, both theoretically and experimentally, that Eulerian state spaces (a superset of undirected state spaces) are very easy for some existing real-time search algorithms to solve: even real-time search algorithms that can be intractable, in general, are efficient for Eulerian state spaces. Because traditional real-time search testbeds (such as the eight puzzle and gridworlds) are Eulerian, they cannot be used to distinguish between efficient and inefficient real-time search algorithms. It follows that one has to use non-Eulerian domains to demonstrate the general superiority of a given algorithm. To this end, we present two classes of hard-to-search state spaces and demonstrate the performance of various real-time search algorithms on them.

Keita Bates-Diop scored a career-high 32 points, and Ohio State stunned No. 1 Michigan State 80-64 on Sunday.

The Bears (12-14, 9-4 Mid-Eastern Athletic Conference) broke it open late in the second half with a 17-2 run bookended with free throws from Carr to make it 62-48 with 2:15 to play as two Delaware State bigs, DeVaughn Mallory and Demola Onifade, fouled out.

The Vikings took the lead for good four minutes in and built a 30-26 halftime lead. Cleveland State opened the second half on a 21-15 surge for a 51-41 lead, and had a double-digit lead the rest of the way.