Home // SOFTENG 2016, The Second International Conference on Advances and Trends in Software Engineering // View article

Reachability Games Revisited

Authors:
Imran Khaliq
Gulshad Imran

Keywords: reachability games, effort based strategies, memoryless determinacy

Abstract:
In this paper, we provide a refined analysis of the classical algorithm for solving reachability games. We provide a new algorithm that remembers information about fewer nodes than the classical algorithm does by computing the number of efforts made by the player to win the game.

Pages: 129 to 132

Copyright: Copyright (c) IARIA, 2016

Publication date: February 21, 2016

Published in: conference

ISSN: 2519-8394

ISBN: 978-1-61208-458-9

Location: Lisbon, Portugal

Dates: from February 21, 2016 to February 25, 2016