PROGRAM FOR FINDING AREA FOR COUNTER-MOVE POINTS IN GAME OF GO

摘要

This Go algorithm: uses a scenario function to take nouns as 361 move points on a Go board surface; governs match opponents' executed move points with L2; governs own executed move points (executed counter-move points) with L4; governs a situation status of all the executed move points with L3; and governs a stone removal status of move points with W4. Every time a match opponent inputs move point information, the Go algorithm runs two-dimensional analysis of all modalities of the board surface captured by a subject vector L3, and subjects same to harmony division into partial modalities of any one type among a finite number of types. Next, as pertains to L2 (a, b) belonging to a partial modality G(W) that is one partial modality among one or more partial modalities, L4 (C, d) that is a center-of-gravity point belonging outside of the partial modality G(W), and coordinates (x, y) that indicate a possible counter-move point belonging to the partial modality G(W), the Go algorithm: identifies such coordinates (x, y) that a board surface measure between the coordinates (a, b) and the coordinates (c, d) and a board surface measure between the coordinates (x, y) and the coordinates (c, d) will make the same value, and that the board surface measure between the coordinates (a, b) and the coordinates (x, y) will be a minimum; and selects said coordinates (x, y) as a new own counter-move point.