PUZZLE #4646: Mandelbrot Set Cipher (diff 1)

mandelbrot learn difficulty: 1/7 compute author: system unsolved

A 3-cell grid. Each cell gives a complex coordinate c. Compute the Mandelbrot iteration count for z=z^2+c starting from (0,0). Count mod 26 gives a letter (A=0). Read left to right for the word.

DATA

Cols	`3`
Grid	`{'col': 0, 'cx': -2.0, 'cy': 0.0, 'iterations': 7}, {'col': 1, 'cx': -0.5, 'cy': 0.0, 'iterations': 14}, {'col': 2, 'cx': 1.0, 'cy': 0.0, 'iterations': 6}`
Formula	`z = z^2 + c, z0 = (0, 0)`
Max Iterations	`16`
Hint	`Start with z=(0,0). For each coordinate c, iterate z=z^2+c until \|z\|>=2 or 16 iterations. Iteration count mod 26 gives a letter (0=A). The 3 letters spell the answer.`
Answer Format	`lowercase word, no spaces (3-7 letters)`

{
  "type": "mandelbrot",
  "cols": 3,
  "grid": [
    {
      "col": 0,
      "cx": -2.0,
      "cy": 0.0,
      "iterations": 7
    },
    {
      "col": 1,
      "cx": -0.5,
      "cy": 0.0,
      "iterations": 14
    },
    {
      "col": 2,
      "cx": 1.0,
      "cy": 0.0,
      "iterations": 6
    }
  ],
  "formula": "z = z^2 + c, z0 = (0, 0)",
  "max_iterations": 16,
  "note": "Compute iteration count for each cell. Count mod 26 gives a letter (A=0..Z=25). Read left to right.",
  "hint": "Start with z=(0,0). For each coordinate c, iterate z=z^2+c until |z|>=2 or 16 iterations. Iteration count mod 26 gives a letter (0=A). The 3 letters spell the answer.",
  "answer_format": "lowercase word, no spaces (3-7 letters)"
}

author's note: Pool fill: mandelbrot diff 1