Similar to this question. 5-color coloring game.
Let there be two players, $$ and $$, and a map.
They now play a game such that:
Player $$ picks a region and player $$ colors it such that the region is a different color than all adjacent regions. Player $B$ wins if at the end of the game, the map is colored such that no two adjacent regions are the same color. Player $A$ wins if at any point in time that becomes impossible. If there are four available colors, then does player $$ have a winning strategy for every possible map?