Algorithm to spend Cannibals and Missionaries

Here we find a brief explanation in the form of algorithm to complete the game Cannibals and Missionaries The idea is that cannibals do not eat the missionaries.

Let's keep in mind that the side which started the cannibals and missionaries will be the side (A) and the other side is the side (B), when I mention assign a click to choose to be missionaries or cannibals mount in the canoe.
So start
Home
Give more than 2 passengers in the canoe side (A)

"Note: This is a sample of the possibilities for this assignment or selection from now on I will no more pictures since these would be too long and the idea is that you go to solve their various possibilities, I would not be show all "



If you are not assigned to canoe minimum 1 "go" button is inactive
It gives "go" to move from side (A) (B)
If left on the side (A) that cannibals missionaries FIN
Select who is on the side (B)
Give more than 2 passengers in the canoe side (B)
But not assigned a canoe minimum 1 "go" button is inactive
Give "go" Skip side (B) a side (A)
hand if (A) to add more cannibals missionaries FIN
But
Give more than 2 passengers in the canoe side (A)
But not assigned a canoe minimum 1 "go" button is inactive
It gives "go" to move from side (A) alongside (B)
If side (A) that are more cannibals missionaries FIN
If not
if side (B) add up to more cannibals missionaries FIN
if not
Select who is
Give more than 2 passengers in the canoe side (B)
But not assigned a canoe minimum 1 "go" button is inactive
Give the "go" to move from side (B) side (A)
Give more than 2 passengers in the canoe side (A)
But not assigned a canoe minimum 1 "go" button is inactive
Give the "go" to move from side (A) alongside (B)
If side (B) add up to more cannibals missionaries FIN
If not
Give more than 2 passengers in the canoe side (B)
But not assigned a canoe minimum 1 "go" button is inactive
Give the "go" to move from side (B) side (A)
If side (B) that are more cannibals missionaries FIN
If side (A) to add more cannibals missionaries FIN
If not
Give more than 2 passengers in the canoe side (A)
But not assigned a canoe minimum 1 "go" button is inactive
Give the "go" to move from side (A) side (B)
If side (A) that are more cannibals missionaries FIN
If side (B) add up to more cannibals missionaries FIN
if not
Give more than 2 passengers in the canoe side (B)
But not assigned a canoe minimum 1 "go" button is inactive
Give the "go" to move from side (B) side (A)
If side (A) to add more cannibals missionaries FIN
If not
Give the canoe up to 2 passengers side (A)
But not assigned a canoe minimum 1 "go" button is inactive
Give the "go" to move from side (A) side (B)
Give more than 2 passengers in the canoe side (B)
But not assigned a canoe minimum 1 "go" button is inactive
Give the "go" to move from side (B) a side (A)
If side (B) that are more cannibals missionaries FIN
If side (A) to add more cannibals missionaries FIN
If not
Give more than 2 passengers in the canoe side (A)
But not assigned a canoe minimum 1 "go" button is inactive
Give the "go" to move from side (A) side (B)
If side (B) add up to more cannibals missionaries FIN
But
You did win

Algorithms

An algorithm is the set of operations and procedures to be followed to solve a problem. In everyday life we use different algorithms for permanent actions like washing clothes, cooking, washing up the teeth and other daily activities.

More
Current Algorithm

Database

What is a Database?

A database is a data set within a context and systematically stored for later use. In this sense, a library can be considered a database comprised mainly of documents and printed texts on paper and indexed for reference. At present, due to technological development in fields such as computing and electronics, most of the databases are in digital format (e), which offers a wide range of solutions to the problem of storing data.

more