Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Chen, Yibo1 | Oon, Wee-Chong2 | Zhu, Wenbin3
Note: [1] Department of Management Sciences, School of Business, City University of Hong Kong. Email: [email protected]
Note: [2] Department of Management Sciences, School of Business, City University of Hong Kong. Email: [email protected] (Corresponding author)
Note: [3] Department of Management Sciences, School of Business, City University of Hong Kong. Email: [email protected]
Abstract: Ricochet Robots is a puzzle game published by Rio Grande Games and designed by Alex Randolph. Given a starting position with four robots on a board and a target space, the objective is to move the active robot to the target space in as few moves as possible. In this note, we announce that Ricochet Robots is strongly solved, i.e., a solution with the minimum number of moves has been computed for all possible starting positions. We solved the game using a complete retrograde analysis on all one trillion (1012) positions on a multi-core personal computer over a period of about a week.
DOI: 10.3233/ICG-2011-34405
Journal: ICGA Journal, vol. 34, no. 4, pp. 223-226, 2011
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]