We give the conditions under which the value of strategy h on graph which consists of N identical graphs joined at one or two points, where the hider uses the same strategy h/n on every single graph, is n times greater or equal than the value of strategy n on one graph. This gives the possibility that using the value of the game on one graph, we can obtain the value on the union of more identical graphs.