Today we are presenting a bunch of content connected by the Theme of: algorithms. We will be firstly presenting an explanation for a special algorithm about Turing machines/V. Neumann architecture: (the algorithm). Then, we will show a embedded mindmap of Mindomo explaining in an easy and understandable way the concept of algorithm. After that, there will be an explanation of the concept of “algorithm” and it’s definition, and a real life example with a game. These work and post was developed by the entire class, the 8 of us. Now let’s start with the post, explanation and real life presentation.
This is the mindmap that we do to explain the definition of algorithm.
There are many concepts in the idea of algorithm that resembles the Turing machines and the V.Neumann architecture. One of them that interested us specially, was the from I/O (Input/Output). The I/O necessity is a similarity between the three concepts/architectures. Every one of them needs an input to start working, and will produce an output, either for the program, or the user.
The concept of algorithm is mainly used in mathematics and computer science, and it is a self-contained sequence of actions to be performed. Algorithms can perform calculation, automated reasoning and data processing, as examples of their common uses.
Algorithms are effective methods that can be expressed within a finite amount of space and time in a formal language for calculating a function. The algorithm starts at an initial state with an initial input. The instructions a path of well-defined successive states, eventually producing an output and entering a “ending” or final state. The transition between states however, is not deterministic, as there are algorithms that incorporate random inputs.
The concepts of algorithm is very old: it has existed for many centuries. The formalization of the term however, began with the search for the answer to the “Entscheidungsproblem” (Decision Problem). Still, giving a formal definition to algorithm remains a challenging problem.
Description of our game
Frist we check to see if the amount of player that joined the game is bigger than 3 and then starts the game, othewise it will throw back a message saying "Not enought players" and the game won't start. After that each Player is given the name Player + number (for example: first player gets the name Player1, second player gets the name Player2 and so on)and, with a series of instructions, we make Player1 and Player2 allies and tell them how to impress the rest of the group. Now the game begins. Player1 select an object in the room, tells the rest of the group wich is without Player2 hearing him and then point at an object of the same color as the object he/she selected, without it being the actual object. After that a loop of pointing and saying no start and goes on until Player1 point at an object with the same color as selected object, this beign it. It is at this moment in wich Player2 notices that it is the same color as the object Player1 selected first and says ("That's it, it is the object you selected!"). at this point the game starts abrouptly with he audience impressed.
The algorithm of our game
If amountOfPlayer >= 3:
Let x = 1
For each player in the room:
For each player in the room:
Assign name (“Player + x”);
Let x = x+1;
Player1 tells Player2 (“The color of the first item I select will be the color of my selected object, but it won’t be the first one I point”) without the rest of the players knowing nor hearing;
Player1 selects an object = SelectedObject ;
Player1 tells AllPlayer except Player2 (“I selected <SlectedObject> and player 2 will guess it”), Player 2 can’t listen nor see;
Player1 points an object of the same color as SelectedObject;
Player2 says (“it isn’t”);
While Player2 doesn’t say (“That’s it”):
Player1 points out an object;
If colorOfThePointedObject == colorOfSelectedObject:
Player2 says (“That’s it, it is the object you selected!”);
break;
Else:
Player2 says (“No it isn’t”);
Else say (“Not enough Players”);
