Interactive Coloring Books in E-Learning #323: Challenge | Recap
Interactive coloring books may not be your go-to interaction for most e-learning projects, but they are a fun way to get lea...
Published 4 years ago
Version 1.0
Blog Post
I’ve been too long in posting a challenge and this one seemed liked a fun one that combined my interest in Storyline dev and my passion for the elegance of mathematical proofs, (though I’m no mathematician myself!).
“Exploring the Four Color Theorem” is my entry for the Interactive Coloring Book challenge. I’ve always been fascinated by mathematical problems, and this is an example of being able to sandbox a problem from graph theory that states: Given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. It was the first major theorem to be proved using a computer.
I’d welcome ideas about a coding challenge. I added an answer key so users can get to one possible correct answer, but there are many correct configurations. In the interest of time, I coded only one of these answers rather than manually code all possible correct configurations. If someone has a better way to code this so that all the manual triggers aren’t necessary, I would love to learn from fellow members of the community.
Exploring the ‘Four Color Theorem’
Demo link: https://s3.us-east-2.amazonaws.com/elh-323-interactivecolor.skillspace360.com/story.html
Source: https://s3.us-east-2.amazonaws.com/elh-323-interactivecolor.skillspace360.com/ELH_Challenge_323_Four_Color_20210429_v1.story
“Exploring the Four Color Theorem” is my entry for the Interactive Coloring Book challenge. I’ve always been fascinated by mathematical problems, and this is an example of being able to sandbox a problem from graph theory that states: Given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. It was the first major theorem to be proved using a computer.
I’d welcome ideas about a coding challenge. I added an answer key so users can get to one possible correct answer, but there are many correct configurations. In the interest of time, I coded only one of these answers rather than manually code all possible correct configurations. If someone has a better way to code this so that all the manual triggers aren’t necessary, I would love to learn from fellow members of the community.
Exploring the ‘Four Color Theorem’
Demo link: https://s3.us-east-2.amazonaws.com/elh-323-interactivecolor.skillspace360.com/story.html
Source: https://s3.us-east-2.amazonaws.com/elh-323-interactivecolor.skillspace360.com/ELH_Challenge_323_Four_Color_20210429_v1.story
This was fun. I solved it but not quite the way you did so there was no "pomp & circumstance:. It was an interesting challenge and I like how simple it was to interact with.