Description: Branch and bound algorithm operation: graphics transform the issue of problem-solving reports and source code. Description of the problem: given two 4 × 4 grid array of graphics components A and B, each box is black or white color. Grid arrays in the public square known as the adjacent side of the box. Transform the issue of graphics can be exchanged every step of the color of the adjacent box. Try to design a queue-type branch and bound algorithm to calculate the minimum number of steps need to transform, can be converted into graphics A graphics B.
To Search:
File list (Check if you may need any files):
game1 图形变换问题
..................\game1.cpp
..................\game1.pdf
..................\game1.ppt
Download