Computer Science, asked by shakshitha08, 7 months ago


Example 6.3. Consider The Chameleons
of Chromeland problem: On the island
of Chromeland there are three different
types of chameleons: red chameleons,
green chameleons, and blue chameleons.
Whenever two chameleons of different
colors meet, they both change color to the
third color. For which number of red,
green
and blue chameleons it is possible to arrange
a series of meetings that results in all the
chameleons displaying the same color?​

Answers

Answered by shookkakani
10

Answer:

GIVE ME DJ ALOK THEN I GIVE ANSWER

Similar questions