Results 1 to 2 of 2
  1. #1
    Join Date
    Feb 2010
    Posts
    1
    Rep Power
    0

    Default Pruning?? (N-Queens problem)

    I have been assigned a project to solve the N-Queens problem. Here is the problem page: http://www.cs.pitt.edu/~aronis/cs044...-n-queens.html

    I have half of the task done; my program solves the solutions without pruning. However, I haven't the slightest idea what "pruning" is in this case. I've Googled the term and all I get are ambiguous, unhelpful results.

    Thanks

    (BTW, this is my first post here :p)

  2. #2
    m00nchile is offline Senior Member
    Join Date
    Feb 2010
    Location
    Ljubljana, Slovenia
    Posts
    470
    Rep Power
    5

    Default

    From what i gather, if a permutation begins with 2 queens attacking each other (for example [1,2,...]), don't test any permutation that begins with this series, but go to [1,3,...], as to not waste cpu cycles on a test, that is surely wrong. Ofcourse, you don't check only the beggining of the permutation, this was just illustration of my example.

Similar Threads

  1. simple line problem / for loop problem
    By helpisontheway in forum New To Java
    Replies: 1
    Last Post: 11-17-2009, 07:12 AM
  2. minmax with Alpha - Beta Pruning
    By Zosden in forum Advanced Java
    Replies: 6
    Last Post: 05-02-2008, 09:40 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •