Figure 5.5 tests out various algorithms on the n-queens problem. Try these same algorithms on map-coloring problems
Question:
Figure 5.5 tests out various algorithms on the n-queens problem. Try these same algorithms on map-coloring problems generated randomly as follows: scatter n points on the unit square; selecting a point X at random, connect X by a straight line to the nearest point Y such that X is not already connected to Y and the line crosses no other line; repeat the previous step until no more connections are possible. Construct the performance table for the largest n you can manage, using both d = 3 and d = 4 colors. Comment on your results.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Artificial Intelligence: A Modern Approach
ISBN: 9780137903955
2nd Edition
Authors: Stuart Russell, Peter Norvig
Question Posted: