, Conf 3 (D ? 3 and #O W = 0) ? * Conf 3((D = 2 and #O W = 0) or Conf RW-BW

, Conf 3(D ? 3 and #O W = 0)? * Conf 10(D = 2 and #O W = 0)

, Since Conf 9(D ? 2 and #O W = 0)(resp. Conf 10(D ? 2 and #O W = 0)) becomes Conf

#. D-=-2-and, Conf RW-BW, or Conf 9(D = 2 and #O W = 0) (resp. Conf 9(D = 2 and #O W = 0)

, Conf 9(D = 2 and #O W = 0), and Conf 10(D = 2 and #O W = 0) become gathering configurations

, Gathering is solvable in full-light of 4 colors when M init is even and O init is odd. It is an interesting open question whether gathering is solvable or not in full

Z. Bouzid, M. G. Potop-butucaru, and S. Tixeuil, Optimal Byzantine-resilient convergence in uni-dimensional robot networks, Theor. Comput. Sci, vol.411, pp.3154-3168, 2010.

Q. Bramas, S. Devismes, and P. Lafourcade, Infinite Grid Exploration by Disoriented Robots, SIROCCO, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02145822

G. Angelo, A. Navarra, and N. Nisse, A unified approach for gathering and exclusive searching on rings under weak assumptions. Distributed Computing, vol.30, pp.17-48, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01326473

G. Angelo, G. D. Stefano, R. Klasing, and A. Navarra, Gathering of robots on anonymous grids and trees without multiplicity detection, Theor. Comput. Sci, vol.610, pp.158-168, 2016.

G. Angelo, G. D. Stefano, and A. Navarra, Gathering on rings under the Look-Compute-Move model, Distributed Computing, vol.27, issue.4, pp.255-285, 2014.

S. Das, P. Flocchini, G. Prencipe, N. Santoro, and M. Yamashita, Autonomous mobile robots with lights, Theor. Comput. Sci, vol.609, pp.171-184, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02082178

A. K. Datta, A. Lamani, L. L. Larmore, and F. Petit, Enabling Ring Exploration with Myopic Oblivious Robots, IPDPS, pp.490-499, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01347444

P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol.11340, 2019.

S. Guilbault and A. Pelc, Gathering asynchronous oblivious agents with local vision in regular bipartite graphs, Theor. Comput. Sci, vol.509, pp.86-96, 2013.

S. Guilbault and A. Pelc, Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line, SSS, vol.8255, pp.296-310, 2013.

T. Izumi, T. Izumi, S. Kamei, and F. Ooshita, Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings, IEICE Transactions, issue.6, pp.1072-1080, 2013.

S. Kamei, A. Lamani, and F. Ooshita, Asynchronous Ring Gathering by Oblivious Robots with Limited Vision, WSSR, pp.46-49, 2014.

S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil, and K. Wada, Gathering on Rings for Myopic Asynchronous Robots with Lights, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02475374

R. Klasing, A. Kosowski, and A. Navarra, Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, Theor. Comput. Sci, vol.411, pp.3235-3246, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00519069

G. A. Luna and G. Viglietta, Robots with Lights, Distributed Computing by Mobile Entities, Current Research in Moving and Computing., volume 11340 of LNCS, pp.252-277, 2019.

S. Nagahama, F. Ooshita, and M. Inoue, Ring Exploration of Myopic Luminous Robots with Visibility More than One, SSS, 2019.

F. Ooshita and S. Tixeuil, Ring Exploration with Myopic Luminous Robots, SSS, pp.301-316, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02076489