A Generalization of 3d Queens Adam Pendry Dr. Robinson May 2 nd 2012.

Slides:



Advertisements
Similar presentations
Polynomial Time Algorithms for the N-Queen Problem Rok sosic and Jun Gu.
Advertisements

COST MANAGEMENT Movement Management. COST MANAGEMENT Cost Management is accessible on the Movement level from MANAGE MOVEMENT page 2 nd Level Navigation.
8 Queens. Problem: Placing 8 queens on a chessboard such that they don’t attack each other Three different Prolog programs are suggessted as solutions.
PROLOG 8 QUEENS PROBLEM.
Undecidability of the Membership Problem for a Diagonal Matrix in a Matrix Semigroup* Paul Bell University of Liverpool *Joint work with I.Potapov.
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 14 Functional Programming It is better to.
Announcements Assignment #4 is due tonight. Last lab program is going to be assigned this Wednesday. ◦ A backtracking problem.
P Chapter 6 introduces the stack data type. p Several example applications of stacks are given in that chapter. p This presentation shows another use called.
Eight queens puzzle. The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard such that none of them are able to capture.
Smallest Number Of Queens Another presentation by Domenic Acitelli.
Parallel Line Proof. Parallel Line Proof The idea behind a proof is that you begin with information that is given to you as part of the problem and you.
Index Values NATIONAL STATISTICAL COORDINATION BOARD.
Triangular Numbers An Investigation Triangular Numbers Triangular numbers are made by forming triangular patterns with counters. The first four triangular.
Backtracking COP Backtracking  Backtracking is a technique used to solve problems with a large search space, by systematically trying and eliminating.
Templates. January 6, Step 1: Activity Template An activity is a task that requires a single submission. Multiple activities may be combined into.
Lecture 12 Another loop for repetition The while loop construct © 2007 Daniel Valentine. All rights reserved. Published by Elsevier.
© 2007 Ray S. Babcock Tracks Game is played on a (nxn) set of squares. There are three possible moves (labeled A,B,C). Players alternate making a move.
10 ThinkOfANumber program1July ThinkOfANumber program CE : Fundamental Programming Techniques.
Prof. Alfred J Bird, Ph.D., NBCT Office – Wheatly 2nd floor Office Hours – MW 3:00PM to 4:00PM.
Data Structures Using C++ 2E Chapter 6 Recursion.
Eduardo Araujo Dustin Littau. Agenda Introduction Requirements Design Testing Conclusion.
Data Structures Using C++ 2E Chapter 6 Recursion.
Department of Computer Science Data Structures Using C++ 2E Chapter 6: Recursion Learn about recursive Definitions Algorithms Functions Explore the base.
Section 3.5 Systems of Equations. What is a system of equations? Two or more equations in the same variables.
Back Tracking Project Due August 11, 1999 N-queens: –A classic puzzle for chess buffs is the N- Queens problem. Simply stated: is it possible to place.
NxN Queens Problem Q- -- -Q Q- -- -Q Q- -- QQ -- Q- Q- Q- -Q QQ -- -Q -- -Q Q- -Q -Q Q- Q- -Q Q- -- Q- -- QQ Q- -Q -Q -Q -- QQ -- -Q START.
Design of Algorithms using Brute Force Approach. Primality Testing (given number is n binary digits)
Modeling and simulation of systems Simulation languages Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Routine Performed for Each Origin Cell There is another set of loops that cycle through Origin Cells once the D8 Neighbor procedure completes.
Solving Inequalities: Review of Unit 12 Created by: Amanda Hollenbacher 1/30/2005.
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
Utility Maximization. Utility and Consumption ▫Concept of utility offers a way to study choices that are made in a more or less rational way. ▫Utility.
Group C. How to Sketch the Graph of an Equation  Graph of Equation: The set of all solution points of an equation 1. Rewrite the equation so that one.
Matlab Programming for Engineers
Copyright © 2015, 2012, and 2009 Pearson Education, Inc. 1 Chapter Probability 3.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
FarmVisit GIS For use with MapWindow Form Supported By:
Write a function rule for a graph EXAMPLE 3 Write a rule for the function represented by the graph. Identify the domain and the range of the function.
1 For ‘Rule of 10s and 3s Example 1’ you will double the power three times and calculate the corresponding dBm values.
State space search Represented by a four-tuple [N,A,S,GD], where: N is the problem space A is the set of arcs (or links) between nodes. These correspond.
1 Project 7: Looping. Project 7 For this project you will produce two Java programs. The requirements for each program will be described separately on.
1 Project 4: Computing Distance. 222 Computing Distance Write a program to compute the distance between two points. Recall that the distance between the.
Claim 1 Smarter Balanced Sample Items Grade 5 - Target B Analyze patterns and relationships. Questions courtesy of the Smarter Balanced Assessment Consortium.
An Analysis of the n- Queens problem Saleem Karamali.
Claim 1 Smarter Balanced Sample Items Grade 4 - Target C Generate and analyze patterns. Questions courtesy of the Smarter Balanced Assessment Consortium.
Section 8.5 and 8.6 Multiplying and Dividing Radicals/Solving Radical Equations.
Common Core Math 7, 8 Adv. May 6, 2016 Sauer
Graphs and Search other searches in addition to breadth-first/depth-first search in game trees search in optimization problems shortest path from vertex.
Friend Function.
CSSE 230 Day 25 Skip Lists.
MATHS 24 MATHS MATHS 24 MATHS 24 GAME RULES:
Chapter 3 Probability.
Introduction to Algorithm – part 1
Sit-In Lab 1 Ob-CHESS-ion
Introduction Defining the Problem as a State Space Search.
Chapter 3 Probability.
Troubleshooting and Maintaining Cisco IP Networks (TSHOOT) practice-questions.html.
BACK SOLUTION:
Elementary Statistics: Picturing The World
If we could pick up one of the parallel lines and move it on top of the other, we would see that the angles created around the vertex are the same. The.
Suppose I want to add all the even integers from 1 to 100 (inclusive)
CS Software Studio Assignment 1
Functions Rules and Tables.
Chapter 3 Probability.
Adding and Subtracting Integers
Rules to play chess. Chess is a played with 16 pieces: 8 pawns, 2 towers, 2 knights, 2 bishops, 1 queen and 1 king. Movements: Pawns: They only can move.
C.2.10 Sample Questions.
C.2.8 Sample Questions.
C.2.8 Sample Questions.
This Poster Template is Provided By ICLS2019
Presentation transcript:

A Generalization of 3d Queens Adam Pendry Dr. Robinson May 2 nd 2012

8 Queens Rules of the 8 Queens Puzzle, 8 Queens 8x8 Chess Board 8 Directions of movement No conflicts allowed

Four Distinct Solutions for 8 Queens

Generalizing Into N Queens Rules of the N Queens Puzzle N Queens NxN Chess Board 8 Directions of Movment No Conflicts allowed N: Soln ,20073,312

Generalize Into 3d NxN Queens NxNxN Chess Board 26 Directions of Movement No Conflicts allowed

Generating a Solutions Bank Using Java to Create Solutions Using Java to Quantify Solutions queenSolutions.get(0) = {1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0, 0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0}

Creating a Template Start with a solution from the bank Create a corresponding template Isolate a queen Determine what layer Add appropriate numbers to indexes

Sample Code for Template

Trimming The Solution Bank

Finding 3d Solutions

Fit Method

Combine Method

Sample Output Base layer is now 0 Entering Conditional Statement fits on top of 0 Entering Conditional Statement fits on top of 975 and 0 Entering Conditional Statement 7 97 fits on top of 2357 and 975 and 0 Entering Conditional Statement fits on top of 97 and 2357 and 975 and 0 Entering Conditional Statement fits on top of 1370 and 97 and 2357 and 975 and 0 Entering Conditional Statement fits on top of 2365 and 1370 and 97 and 2357 and 975 and 0 Entering Conditional Statement fits on top of 325 and 2365 and 1370 and 97 and 2357 and 975 and 0 Entering Conditional Statement fits on top of 1780 and 325 and 2365 and 1370 and 97 and 2357 and 975 and 0 Entering Conditional Statement fits on top of 2592 and 1780 and 325 and 2365 and 1370 and 97 and 2357 and 975 and 0 Entering Conditional Statement fits on top of 578 and 2592 and 1780 and 325 and 2365 and 1370 and 97 and 2357 and 975 and 0 This is solution number 1 0, 975, 2357, 97, 1370, 2365, 325, 1780, 2592, 578, 2108,

Results Size # Of Solutions Found # Of Solutions Previously Claimed

Proof Of Concept