eISSN: 2574-8092
Submit manuscript...
Research Article Volume 11 Issue 3
Optimal solutions for the first three stages of paid version of Lightbot
Songming Hou, Jianning Su
Received: October 16, 2025 | Published: October 29, 2025
Citation: Hou S, Su J. Optimal solutions for the first three stages of paid version of Lightbot. Int Rob Auto J. 2025;11(2):98-102. DOI: 10.15406/iratj.2025.11.00307
Abstract
Lightbot is an interesting game app that has strong educational purpose to guide kids at young age to learn programming skills. It has a free version named Lightbot Code Hour consisting of 20 levels we studied in the past. It also has a paid version consisting of 50 levels with some more complicated rules. Although it is not too hard to solve the puzzles, finding the optimal solutions with the smallest number of blocks is non-trivial for some levels. In this paper, we provide a complete list of the block numbers for optimal solutions for the first three stages in the paid version, as well as the detailed analysis of all the nontrivial levels in these three stages.
Keywords: lightbot, optimal solution, periodicity
©2025 Hou, et al. This is an open access article distributed under the terms of the, which permits unrestricted use, distribution, and build upon your work non-commercially.