here's another math related project because why not (I don't think this is worth posting but it was fun to make so here you go) If it guesses the wrong number, try again with the same number and then comment if it happens again. There shouldn't be any problems with that, but you never know :/ I know that I could just code out the 2^6 = 64 ways to get each number, but that's boring and completely ruins the point, so scroll down to find out the trick (tell-your-friends-able) :) I still got lazy and made a separate sprite for each button + different costume for each finishing button because I don't feel like making a text/number engine. ok scroll down for explanation even though no one cares (warning: it's boring) so basically I used binary (not gonna explain what it is so if you don't know, I suggest you look it up), if you change each number from 1 to 63 to its binary form, you'll find that the first set consists of numbers whose last digit is 1, the second set is numbers whose second to last digit is 1, and so on. The response to each question gives you one of the digits (it's always either yes = 1 or no = 0) and all of the questions form the up to 6 digit number. Whenever you answer yes to a question, the final answer changes by the first number in the set (a power of 2) because of place value in binary, so for example, if you answer yes, no, yes, no, yes, no, your final answer will be 1+4+16, or 21, which can also be written as 10101 in binary, or your sequence of answers read backwards. That probably makes no sense, but my point is, if you want to show this trick to your friends, just add up the first numbers of all the sets they answered yes to and you'll instantly figure out the selected number :) ok that's all bye :D
