0 оценок0% нашли этот документ полезным (0 голосов)
15 просмотров1 страница
The document discusses how a FIFO branch-and-bound algorithm would search the state space tree to solve the 4-queens problem, where queens must be placed on a 4x4 chessboard so that no two queens attack each other.
The document discusses how a FIFO branch-and-bound algorithm would search the state space tree to solve the 4-queens problem, where queens must be placed on a 4x4 chessboard so that no two queens attack each other.
The document discusses how a FIFO branch-and-bound algorithm would search the state space tree to solve the 4-queens problem, where queens must be placed on a 4x4 chessboard so that no two queens attack each other.
The Term Branch-And-Bound Refers To All State Space Search Methods in Which All Children of The E-Node Are Generated Before Any Other Live Node Can Become The E-Node