On one approach to realization of the branch-and-bound method on a distributed system

The branch-and-bound method is one of most efficient search algorithms. However, parallel decomposition of this method is difficult even on architectures with common memory, not to mention distributed systems. The paper describes an algorithm for solution of the problems that can be solved with the branch-and-bound method on a distributed computer system. The results of testing of the proposed algorithm via solution of the chess-game problem are presented.