Java implementation of ehrenfeucht -弗莱斯游戏图。

Introduction EFGraph is a Java implementation of Ehrenfeucht-Fraisse game on graphs with white and black nodes. This kind of graph is a special case of a model in mathematical logic. EFGraph implements tools for creating and modifying such graphs and generating random graphs. The game can be played between two human players, between a human and an AI player or between two AI players. The AI opponent uses the MinMax algorithm. What is an Ehrenfeucht-Fraisse game? The form of Ehrenfeuct-Fraisse game implemented in EFGraph has two players: spoiler and duplicator and two graphs. The number of rounds is n, and it is fixed at the beginning of the game. The spoiler tries to show that the graphs are not n-isomorphic, whereas the duplicator tries to show that they are. Each round in the game consists of a move of Spoiler, followed by a move of Duplicator. The spoiler chooses an element from either of the graphs. The duplicato