Simon shows the Cannon game he created in Processing (Java). He says he was inspired by the Stackoverflow forum, where he saw an example of the game and later wrote the code for a similar game himself. I saw him quickly write the code in a matter of perhaps two hours. Simon will post his code on GitHub once he has added a couple extra features.
Simon has made his version of Daniel Shiffman’s Wikipedia Crawler, graphing the relatedness between Wikipedia articles.
Play with it yourself online at: https://simon-tiger.github.io/wikipedia-crawler/wikipedia/
How it Works
Enter a query (e. g. apple) and either hit Enter or press the button “Query the API”. If an article called “Apple” exists, a circle will pop up with th word “Apple” in it. If an article called “Apple” doesn’t exist, a circle with something alse will pop up. Click the circle (or article) to reveal its related articles. As you might expect, you can click any of those articles to reveal its related articles.
The inspiration comes from Daniel Shiffman and its Coding Train. Link to Daniel’s version here.
Last Friday Daniel Shiffman was finally back with his weekly livestreams! Simon was delirious with joy that he could be part of the team again and weeping and panicking every time Daniel experienced technical difficulties. During the days that followed, Simon made his own two versions of the coding challenge Daniel presented in the livestream and shared those with his colleagues on GitHub and the Slack channel: “I made *two* versions of the acrostic coding challenge. Link to a github repo: https://github.com/simon-tiger/acrostics (Links to both of the versions in the README).
The coding challenge was part of Daniel Shiffman’s Programming A to Ze course at NYU (a course focusing on analysis and generation of text-based data) and was about creating an Acrostic machine – an algorithm that would use a source text to create a “poem”. Every word in the poem would begin with the consecutive letter from a word one enters.
One version that Simon created uses an API as the source text:
In the second version, the user can type the source text (like in the screenshot below), use a text sample or drag a source text file into a special dropbox:
Screenshot of the second version (with drag and drop):
Simon making his versions of the Acrostic machine:
Simon set the timer for himself for 10 to 15 minutes, programming parts of the Rumikub game in Java (Processing):
A few more pics from the coding everywhere series:
Here Simon made a game especially for his sister:
Among the remaining favorites were reading (see an earlier post), swimming (and playing in the water) and, surprisingly still very high up on the list, popping giant balloons. City trips, walking and museums were way down below or even cancelled all together, even though the visit to Park Güell can be rated as successful.
Now that we are back home, Simon may be too busy to continue teaching me on a regular basis, but I am very happy with what he has taught me so far and I think I’ll be able to understand his projects at a deeper level now.
Simon built a beautiful interactive circle intersection program in Processing, in which the circles detect intersection and change colors (according to Perlin Noise) once it occurs. The player can control the number of circles by adding and removing them in two modes (mouth clicked and mouth dragged). Simon added a button to switch between the two modes. (Loosely based upon Daniel Shiffman’s tutorials on checking object intersection).
Simon hasn’t put this project online yet, as he wanted to make it more interactive and hasn’t managed to do that so far.
Simon has turned Daniel Shiffman’s Maze Generator Coding Challenge (generating a maze using the Depth-First Search Recursive algorithm) into a game in Processing (Java). It’s not fully operative yet, as the player can partially walk through walls, but Simon did get quite far and even received positive comments from Daniel Shiffman.
Simon has created a great new game in Processing: The Hero Game! It is somewhat like the good old Mario, except that Simon has no idea what Mario is and came up with the concept himself. The game is based upon Circle-Rectangle Intersection, something that he was studying for the past several days. It was impressive to see how quickly he wrote the program for the game, I think it took him something like an hour, while waiting for dinner. The game has a hero (Simon), represented by the yellow circle, obstacles (from below and above) and money that the hero collects to get points. The game stops once the hero hits an obstacle. Simon is planning to add extra random obstacles and maybe also create a winning score threshold (around 50 or 65, he says). His own highest score so far has been 35.
Below are the making-of videos, step by step:
Update: Simon added trees!