GO Solution For UVa 10001 - Garden of Eden. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

Cellular automata are mathematical idealizations of physical systems in which both space and time are discrete, and the physical quantities take on a finite set of discrete values. A cellular automaton consists of a lattice (or array), usually infinite, of discrete-valued variables. The state of suc

...

You can find the full details of the problem Garden of Eden at UVa Online Judge

Sample Input

0 4 1111
204 5 10101
255 6 000000
154 16 1000000000000000

Sample Output

GARDEN OF EDEN
REACHABLE
GARDEN OF EDEN
GARDEN OF EDEN

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985