Make the longest snake that you can by clicking on the green squares.

A *snake* is a connected chain of squares, where each square shares a side
with the next square and the previous square, but does not share a side
with any other squares.

Score: 0

Rows | Columns | Score |
---|---|---|

2 | 2 | 3 |

3 | 3 | 7 |

4 | 4 | 11 |

5 | 5 | 17 |

6 | 6 | 24 |

7 | 7 | 33 |

8 | 8 | 42 |

9 | 9 | 53 |

10 | 10 | 64 |

11 | 11 | 77 |

12 | 12 | 92 |

13 | 13 | 107 |

14 | 14 | 123 |

15 | 15 | 142 |

16 | 16 | ≥ 161 |

Thanks to Christopher Danielson (@Trianglemancsd) for introducing me to this problem. The best possible scores were computed by Alain Goupil (up to n = 14) and Andrew Howroyd (n = 15).