Definition: two players, the first to place n stones in consecutive line (horizontal, vertical, diagonal) wins. A real-life examples are tic tac toe (n=3, k=3) and Gomoku (n=5, k=18). My question is, for what n and k does the game have a must-win strategy? A compromised question is, does there exist a general algorithm to approach the optimal strategy?