{"id":2702,"date":"2013-08-17T21:11:37","date_gmt":"2013-08-17T11:11:37","guid":{"rendered":"http:\/\/legoeng.local\/?p=2702"},"modified":"2022-08-01T12:12:07","modified_gmt":"2022-08-01T02:12:07","slug":"how-to-write-efficient-nxt-g-programs","status":"publish","type":"post","link":"http:\/\/legoeng.local\/how-to-write-efficient-nxt-g-programs\/","title":{"rendered":"How to write efficient NXT-G programs"},"content":{"rendered":"

\"Screen<\/a>Writing Efficient NXT-G Programs (PDF) describes how to make your NXT-G programs as efficient as possible to create complex behaviours with a minimum of memory. These techniques are particularly relevant for competitions such as FIRST LEGO League (FLL) and RoboCup Junior, in which competitors often download several complex programs onto a single NXT brick.<\/p>\n

The techniques include:<\/p>\n