Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search
finding a shortest solution for the n × n extension of the 15 - puzzle is intractable .