Pruning: When to Stop?

Posted by cam on Stack Overflow See other posts from Stack Overflow or by cam
Published on 2010-04-23T20:24:38Z Indexed on 2010/04/23 20:43 UTC
Read the original article Hit count: 332

When does pruning stop being efficient in a depth-first search? I've been working on an efficient method to solve the N-Queens problem and I'm looking at pruning for the first time. I've implemented it for the first two rows, but when does it stop being efficient? How far should I prune to?

© Stack Overflow or respective owner

Related posts about c++

Related posts about algorithm