An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle

Kaede Utsunomiya, Yuichi Asahiro. An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle. In Osvaldo Gervasi, Beniamino Murgante, Sanjay Misra, Marina L. Gavrilova, Ana Maria Alves Coutinho Rocha, Carmelo Maria Torre, David Taniar, Bernady O. Apduhan, editors, Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Banff, AB, Canada, June 22-25, 2015, Proceedings, Part II. Volume 9156 of Lecture Notes in Computer Science, pages 457-473, Springer, 2015. [doi]

@inproceedings{UtsunomiyaA15,
  title = {An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle},
  author = {Kaede Utsunomiya and Yuichi Asahiro},
  year = {2015},
  doi = {10.1007/978-3-319-21407-8_33},
  url = {http://dx.doi.org/10.1007/978-3-319-21407-8_33},
  researchr = {https://researchr.org/publication/UtsunomiyaA15},
  cites = {0},
  citedby = {0},
  pages = {457-473},
  booktitle = {Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Banff, AB, Canada, June 22-25, 2015, Proceedings, Part II},
  editor = {Osvaldo Gervasi and Beniamino Murgante and Sanjay Misra and Marina L. Gavrilova and Ana Maria Alves Coutinho Rocha and Carmelo Maria Torre and David Taniar and Bernady O. Apduhan},
  volume = {9156},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-21406-1},
}