I started off with trying out obscure shapes, attempting to figure out exactly what shaped causes what kind of result for the cat.
From my experiments, it looks like the look for certain features first, then allow duplicates. For example I thought at times I would have two legs but no tail but it seems that it tries to put a tail in the space anyways? Or that I thought my feature would be an arm, but it turned out to be an ear. I also thought it was interesting how it worked with my lines that had no volume; my cat simply looks like it has a folded seam overtop of it.
After exploring this generator for a bit, I theorized that it used very similar technology to Photoshop's stamp and healing brush tool, where it copies over a certain image, reads the surface below that it is copying over, and tries to match both textures.
Looking at both of these generators, it's interesting to see what they take from each image. My first general one wasn't so successful, but as I played around with how much of each image it took, it became much more interesting. I also enjoyed the second one, portrait, which was very similar to a "baby face generator", but then when I inserted a pancake, I got really fun results. I like the texture I created on the lady.
After exploring this generator for a bit, I theorized that it uses very similar technology to xtran, only without a microprocessor. The only difference is the way it handles the input data. xtran uses a binary (or binary tree of binary data) format, and I found an obvious similarity in this way. The tree, in the generator, is basically the size of bytes of the input data, minus any padding on the right side. For instance, a character or character combination of 10 bytes would look like this:
00100000 02102001 00110 000010 00000001 000100 < < < 10 012 < 100 0f 011 < 02 < 00 <
The generator is the same, the only difference is the padding and data on the left side. For this reason, I was able to use the Tree Generator, but only from the following generator:
The generator uses a variable-length (0-255 bytes) binary tree with a single insertion and removal node. The initial node, i, is a random seed, which is derived from a random number generator (also in hex). The insert and remove nodes.
There was no way he could actually like him, after all that he had done. It was insane! No possible way that there would be any chance for romantic feelings to develop. He had just tried to save him!
"Are you insane," said his girlfriend. "This guy, he is so far away and in such a dark place and he is trying to help you!"
'But it is only possible if you are on some form of medication,' he countered. 'If you are just like in high school all the time. This is ridiculous!'
Serena could have been saying this. It was that last day of school. She was about to go to play basketball at one of the two places where she wanted to go play basketball. The first one had been cancelled for reasons yet to be known to her. And with her being so far away from her old life and the one she lived in, there was no way either place would be welcoming her in at this time.
Her parents were on vacation and would be gone until a couple of days later. They would be home on Wednesday, and she didn
Google AI Experiments
rock paper scissors
I thought this project was really intriguing because of how simple the premise was. I also enjoyed learning about how they made it; the developers had used all technology I have seen before and I thought it was really cool the way they made it work together. I guess the only thing that's rough about this project is that the computer will always win in rock paper scissors.