***** 2016-07-09 - currently being re-written so consider the project unstable ***** Press the green flag Keep the questions as short as possible because the entire database is stored in a single cloud variable Note: If two people are playing at the same time, one is going to overwrite the others database changes. This was intended for only 1 person at a time but I didn't add code to enforce that.
***** 2016-07-09 - currently being re-written so consider the project unstable ***** Nearly 3 years ago, I had the idea for this project - https://scratch.mit.edu/discuss/topic/12881/ The problem is, cloud variables are the only way for data to be persistent and they aren't very user friendly. This program uses 5 bit bytes to first reduce the size of the Binary Search Tree (BST) before encoding it from/to a cloud variable. This game has a very long history going back to at least 1974 http://www.fourmilab.ch/documents/univac/animal.html I searched and found a couple of other attempts 1. https://scratch.mit.edu/projects/13199761 2. https://scratch.mit.edu/projects/13416580 I only allowed myself an afternoon to work on this otherwise I would have improved performance by using binary searches and devising a better indexing strategies for finding records than a linear search. Feel free to re-mix this if you want to improve performance - I am happy to explain as best as I can how it works. Created: 2016-07-03
