MathDB

Alzim and Badril are playing a game on a hexagonal lattice grid with 37 points (4 points a side), all of them uncolored. On his turn, Alzim colors one uncolored point with the color red, and Badril colors two uncolored points with the color blue. The game ends either when there is an equilateral triangle whose vertices are all red, or all points are colored. If the former happens, then Alzim wins, otherwise Badril wins. If Alzim starts the game, does Alzim have a strategy to guarantee victory?

Problem Statement