August 2010
Intermediate to advanced
288 pages
13h 21m
English
In this chapter, I’ve taken you through all the steps involved in developing a typical NXT-G maze-navigating program. You’ve developed this program piece by piece, just as you would develop a program on your own. At each step you added a logical piece of the program, did some testing, and then made necessary modifications to adjust the move durations and to fix bugs.
The next chapter starts your exploration of data wires, one the most powerful features of the NXT-G language.