2000 character limit reached
Move-minimizing puzzles and diamond-colored modular/distributive lattices (1710.01597v4)
Published 2 Oct 2017 in math.CO
Abstract: The move-minimizing puzzles presented here are certain types of one-player combinatorial games that are shown to have explicit solutions whenever they can be encoded in a certain way as diamond-colored modular or distributive lattices. Our work here is founded in a new interpretation of some routine and elementary order-theoretic combinatorics.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.