Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Other Mathematics
Rush Hour® And Dijkstra’S Algorithm, Mark Stamp, Brad Engel, Mcintosh Ewell, Victor Morrow
Rush Hour® And Dijkstra’S Algorithm, Mark Stamp, Brad Engel, Mcintosh Ewell, Victor Morrow
Faculty Publications, Computer Science
The game of Rush Hour® includes a 6 × 6 grid and game pieces representing cars and trucks. The object of the puzzle is to move a special car out of a gridlocked “traffic jam.” In this note we apply Dijkstra’s algorithm and a breadth-first search to solve any Rush Hour configuration.
Modal Rules Are Co-Implications, Alexander Kurz
Modal Rules Are Co-Implications, Alexander Kurz
Engineering Faculty Articles and Research
In [13], it was shown that modal logic for coalgebras dualises—concerning definability— equational logic for algebras. This paper establishes that, similarly, modal rules dualise implications:It is shown that a class of coalgebras is definable by modal rules iff it is closed under H (images) and Σ (disjoint unions). As a corollary the expressive power of rules of infinitary modal logic on Kripke frames is characterised.