2.3.1f.e: Standard algorithm for Dijkstra's shortest path
Connect the wires to complete the circuit and zap the bug. The faster you choose the right keyword, the more points you get for zapping the bug!
Use the clues to guess the keywords and fill in the blank spaces on the crossword
Click on the keywords that do not match the definition
Click to jump. Collect a letter each time you pass a pipe
Guess the letters of the definition
Guess the letters of the keyword
Rearrange the letters of the keyword into the right order
Choose a game at random
Control the snake to eat each letter of the keyword in order
Type out the definitions as fast as you can
Find the words that match each definition
