MAS336 Computational Problem Solving. Problem 3: Eight Queens

Size: px
Start display at page:

Download "MAS336 Computational Problem Solving. Problem 3: Eight Queens"

Transcription

1 MAS336 Computational Problem Solving Problem 3: Eight Queens Introduction Francis J. Wright, 2007 Topics: arrays, recursion, plotting, symmetry The problem is to find all the distinct ways of choosing 8 squares on an 8 8 grid such that no square lies on the same row, column or diagonal as any other, where "distinct" means "not related by symmetry". (There are 92 solutions but only 12 distinct solutions.) The final result must be displayed in a neat and compact graphical form. If you play chess then you may recognize this as the problem of placing 8 queens on a chess board such that no queen threatens any other, and I will use the chess metaphor in future. This problem is well know in computer science as the "eight queens problem" and is a classic example of a "backtracking" algorithm. See [1] for a solution using the procedural language Pascal, [2] for a solution using Modula-2, the successor to Pascal, which has a syntax very similar to that of Maple, [3] for a solution using the symbolic language Lisp, and [4] for a solution using the declarative language Prolog. However, none of these references pursues the symmetry considerations in any detail. Solutions have probably been published using most programming languages, although I have not seen one using Maple. Hence, for credit in this course, this problem must be solved using Maple, although you may use whatever background material you wish. According to [1], C. F. Gauss investigated this problem in 1850 but did not completely solve it, which is not too surprising since it is much easier to solve by computer than by hand! The overall solution process falls into three stages: generating all possible solutions (ignoring symmetry); plotting one or more solutions; reducing the solutions by keeping only a single representative of any set of solutions that are related by symmetry. Task 1: Generating all possible solutions This problem is naturally recursive and there are two main considerations: determining whether two queens threaten each other, and placing the queens on the board. Clearly no two queens may lie in the same column, so we can solve the problem column by column, by placing a queen in the first column, then placing a queen in the second column so that it is not threatened by the queen in the first column, then placing a queen in the third column so that it is not threatened by any of the queens already on the board, and so on until we have placed a queen in every column. If we are unable to place a queen in any column then we need to "backtrack" and try a different position for the queen in the previous column. To ensure that we find all solutions we should try to place each queen in the first row of its column, then the second, and so on until we have tried all 8 rows. In this way we systematically consider every square of the board. To proceed further we need to have concrete representations for the abstract concepts we are working with. The chess board is best represented by using a two-dimensional integer coordinate system, with each coordinate running from 1 to 8. There are two sensible choices of axes: one would place square (1,1) in the top left corner with the vertical coordinate increasing downwards; the other would place square (1,1) in the bottom left corner with the vertical coordinate increasing upwards; in both cases the horizontal coordinate is the first and increases to the right and the vertical coordinate is the second. The former agrees with the coordinate system used for matrices and might be most convenient if we needed to store the whole chess board as an array; the latter agrees with the Cartesian coordinate system used for plane geometry and might be the most convenient for displaying solutions graphically. I recommend the latter for this problem. The position of one queen can be represented by an ordered pair of coordinates in the chosen coordinate system and one complete solution consists of the positions of all 8 queens. The order in which the queens are placed on the board is not a significant aspect of the solution and anyway is encoded in the first coordinate, hence a solution can be represented as a set of coordinate pairs. Indeed, it turns out that using a set (rather than an ordered structure such as a list) makes the symmetry reduction very much easier, because queen positions that are related by a symmetry will typically occur in different locations within an ordered data structure, making it difficult to compare one solution with another related to it by a symmetry. We require all possible complete solutions, which could be collected into an ordered or unordered data structure. The collection of solutions has a natural order that arises from the order in which they are constructed (which is, in fact, a lexicographic order on the coordinate pairs) and it is convenient to display them in this natural order. It turns out to be a considerable advantage to use a data structure that preserves order to facilitate symmetry reduction, so I recommend collecting the complete solutions into a list. The first ingredient is a "threat" predicate (Boolean-valued function) defined on pairs of queen positions that returns true if the two 1

2 queens threaten each other; the relationship is symmetrical. If each queen is represented by its coordinate pair then elementary coordinate geometry can be used to determine whether the two queens are in either the same row or the same diagonal, remembering that there are two possible diagonals at right angles to each other. We could also test whether the two queens are in the same column, but since we will never attempt to place two queens in the same column this is not necessary. This predicate is sufficiently simple that it can (but need not) be implemented as a single line of Maple code. The main solution algorithm is contained in a single recursive procedure that places queens in all columns from some starting column working from left to right up to the right edge of the board; the procedure should take the starting column as an argument. The procedure works by running systematically through all the squares in the starting column and trying to place a queen in each of them. If this queen is not threatened by any of the queens already on the board then the procedure includes this queen position in the solution set and then calls itself recursively to place queens on the rest of the board, unless this was the rightmost column, in which case the procedure outputs the solution. It then tries the next square in the starting column in order to generate the next solution. The current solution (so far) can either be stored in a global variable or passed as an argument to each recursive call of the main procedure. If a global variable is used then it is necessary to remove the current queen position before trying the next square in the current column. There is not much to choose between the two approaches, although using a global variable is probably slightly simpler and does not require multiple copies of the solution. In order to check that a queen position is allowed it is necessary to check that a queen there would not be threatened by any of the queens already in the solution set, which means checking that the threat predicate is not true when applied to the new queen position with each of the old queen positions in turn. If we call the new queen position P and the old queen positions P1, P2,... then the new queen position is not allowed if Threat(P,P1) or Threat(P, P2) or..., which can be determined succinctly using the Maple library function ormap, which maps a predicate over a data structure, such as a set, and combines the resulting values using the Boolean or operator. While developing the code to solve this problem, I recommend simply printing each completed solution set initially. Once that appears to be working correctly, add the code necessary to accumulate all the complete solution sets into a list. I also recommend making the board size a parameter assigned to a global variable, and setting this to values smaller than 8 for initial testing. Use a value (such as 5) that gives a small but non-trivial number of solutions; there are no solutions at all for board sizes of 2 or 3, as you should easily be able to verify. For a board size of 4 there are two solutions related by a very obvious symmetry (hence one distinct solution). For a board size of 8 there are 92 solutions; whilst it would be awkward to check all 92 solutions it is easy and useful to check that the number of solutions is 92. Task 2: Plotting solutions It is useful to write code to display solutions next, because a graphical display is much easier to check visually that a set of pairs of integers. Once the display code is developed, it can be used to check a few random solutions, and for small board sizes it can be used to check all solutions and the symmetry-reduction process. The chess board itself can be plotted as two sets of parallel lines, one horizontal and one vertical, and provides a background for each solution. (There is no need to colour alternative squares differently, as is conventional on a real chess board; to do so is an optional extra.) Each queen can be plotted as some figure centred within the appropriate square of the chess board, and I recommend implementing this as a procedure that takes the position of a queen as its single argument. A disk is a suitable representation of a queen and can easily be generated with the help of the Maple plottools package. (More sophisticated figures that look more like real chess pieces could optionally be generated, but complete the solution using simple disks first!) One complete solution can be plotted by combining a plot of the board with a plot of a queen at each location appropriate to the solution, and I recommend implementing this as a procedure that takes one complete solution set as its single argument. You can then apply this procedure to arbitrarily chosen solutions from the list of all solutions, which is useful to test both the plotting procedure and the solutions! The final step is to display a list of solutions together in a compact fashion. When plots[display] is applied to an array of plot structures, it displays them in the tabular arrangement implied by the structure of the array, which can be a horizontal row of plots, a vertical column of plots, or an arbitrary two-dimensional configuration. Every array element must contain a plot structure, but an empty plot represented by the data structure PLOT() can be used as a filler if necessary. For example, 13 plots could be displayed compactly as a 3 5 array, in which two cells are empty plots. (It is not hard to write some general-purpose code to choose appropriate array dimensions automatically, but that is an optional extra that goes beyond what is required here.) Task 3: Removing symmetry-related solutions A symmetry is an operation that preserves the nature of an object. The operations that preserve the nature of a square are reflection in horizontal, vertical and diagonal lines and rotation by any whole number of quarter turns. Combinations of these operations are also symmetries; for example, horizontal reflection followed by vertical reflection is equivalent to rotation through two quarter turns. Such a set of operations, including the identity operation (which makes no change at all) is called a symmetry group. What we need to consider is a minimal set of operations that are equivalent, when used in combination, to all possible symmetry operations; such a 2

3 minimal set constitutes a set of generators for the symmetry group. If you are familiar with the necessary group theory then you can use it. If not, I suggest that you draw (by hand) a square with different letters at each corner, apply various symmetry operations to it, and compare the results. Using too many symmetry operations is just inefficient, although using too few will leave solutions that are related by symmetry, which should be fairly easy to spot when you display the reduced set of solutions. For this problem, there are 7 non-trivial symmetry operations (because the relevant symmetry group, including the identity operation, has order 8). Some more formal group theory is considered in the next section. For this problem, a symmetry operation is a transformation from one coordinate pair to another. For example, the operation corresponding to reflection symmetry about the leading diagonal simply exchanges the coordinates. This is the only symmetry relating the two solutions in the case of a 4 4 board. When this symmetry operation is applied to one solution the result is identical to the other solution. However, the two solutions are only identical under this symmetry operation if they are regarded as sets of coordinate pairs, within which the order of elements is not significant. If the order were taken into account then they would not be identical until they had been "canonicalized" in some way, such as by sorting on the first coordinate. Representing each solution as a set of coordinate pairs works well in Maple, because Maple automatically canonicalizes sets, which is the way in practice that Maple ignores the order of elements in sets. For this problem, each symmetry operation can be implemented as a very simple Maple function that takes a coordinate pair as its single argument and returns a new coordinate pair. For example, in the case of the transposition symmetry discussed above the function can be implemented simply as (P::[posint,posint])->[P[2],P[1]], where P is a list of two elements representing a coordinate pair. To reduce the solutions with respect to a particular symmetry operation, apply the operation to every element of the first solution set in the list and then remove any solution set later in the list that is the same as the transformed first solution. Then apply the operation to the second solution set remaining in the list, and so on until you have applied the symmetry operation to every element remaining in the list. In Maple, it is tempting to use a for...in loop, but this may not work because the control parameters of a for loop are determined only at the beginning of the loop. So a for...in loop will apply the symmetry operation to every element of the original solution list: if solution sets A and B are related by the symmetry being considered, this loop will use A to remove B correctly, but it will then continue and use B to remove A incorrectly, and so it will remove all symmetry-related solution sets instead of leaving the first representative. A while loop might appear superficially to be less elegant, but it re-evaluates the loop continuation condition before each iteration, which is exactly what is required for this symmetry-reduction problem. A while loop can be used to consider each successive element of the solution list until there are no further elements. Group theory This section assumes some familiarity with elementary group theory. The use of formal group theory is not essential for this problem, but it provides a useful framework and a way to ensure that the symmetries are fully accounted for. The brief discussion of plane isometries in [5] is almost sufficient. We are interested in the symmetry group of the square, which is the dihedral group of order 8, consisting of the four distinct rotations about the centre through 0, 1, 2 and 3 quarter turns, i.e. 0, π,, 2 π 3 π radians, and the four 2 reflections about the mirror lines through the centre parallel to the sides and diagonals. The word dihedral means reflection, and since this group contains four reflections it is often denoted symbolically by D 4. (Some authors denote it by D 8 because it is of order eight, but I will follow [5] and use D 4.) The rotation group of the square (consisting only of the four distinct rotations) is the cyclic group of order 4 denoted C 4, which is a subgroup of D 4. It is sufficient to focus on just the smallest rotation, often denoted by S, which in this case is the rotation by one quarter turn, and any reflection, often denoted by R. The rotation group is said to be generated by S, which means that it consists of all distinct powers of S, hence C 4 = { I, S, S 2, S 3 }, where I denotes the identity transformation equivalent to S 0. Because four quarter turns are equivalent to one complete turn, which is equivalent to no turn, the generator S satisfies relations of the form S 4 = I, = S, etc, which is why such a group is called cyclic. The nth power of a transformation means the transformation applied n times, so powers of a transformation necessarily commute (meaning that they can be applied in either order and give the same result). Hence, all the elements of a cyclic group commute; such a group is called commutative or Abelian. The full dihedral group is generated by S and R together, which means that it consists of all distinct powers and products of S and R, hence D 4 = { I, S, S 2, S 3, R, RS, RS 2, RS 3 }, where the four elements represented in terms of R are the four reflections. But why are there no other elements? No other powers of S are required in view of the previous argument for the cyclic subgroup C 4. A reflection necessarily undoes itself, or equivalently is its own inverse, so R 2 = I or equivalently R = R ( 1 ). Hence no other powers of R are required. (Put another way, R generates another cyclic subgroup of order 2.) This must also apply to the element RS, since it is also a reflection, so RSRS = I or equivalently (by pre-multiplying by R) SRS = R. From these relations it is easy to deduce that RS 2 RS 2 = I and RS 3 RS 3 = I, and moreover that SR = RS 3, S 2 R = RS 2 and S 3 R = RS. This shows that there are no other distinct elements in the group and also that the elements do not all commute with each other; such a group is called non-commutative or non-abelian. The dihedral group D 4 is completely specified by the two generators S and R together with the relations S 4 = I, R 2 = I, ( R S ) 2 = I (or any S 5 3

4 equivalent set of independent relations). A dihedral group can also be generated by two reflections about neighbouring mirror lines. The way to make this somewhat abstract group theory concrete is to draw a small square on paper and then label its corners differently, such as with the letters a, b, c, d (which breaks the symmetry). Then apply to the labelled square various operations that are symmetries of the underlying square and see what they do to the labels. It is instructive (and easy) to verify all of the above properties of the symmetry groups C 4 and D 4. These properties generalize in a straightforward way to the cyclic and dihedral groups of any order. Note that placing queens on a chess board is a way of labelling the square chess board that, in general, breaks the symmetry (to some extent). Orbits and equivalence classes Suppose a symmetry group G acts on a set S, which means that when a symmetry operation in G is applied to an element of S the result is an element of S. We are interested in the case that G is the dihedral group D 4 and S is a set of labelled squares, in particular chess boards having different configurations of queens placed on them. It is an equivalence relation for two elements of S to be related by the action of an element of G. The subset of S generated by taking a single element s of S and applying each element of G to it is called the orbit of s under the action of the group G. Hence, an orbit is an equivalence class. All the elements of the orbit of s have the same symmetry (since they are all symmetry transformations of s), and the number of elements in the orbit depends on this symmetry. If the elements of the orbit have no symmetry at all then the orbit will have the same number of elements as does the group, since each element of the group will generate a distinct element in the orbit; if each element of the orbit has the full symmetry of the group then the orbit will have only one element, since no element of the group will generate a new distinct element in the orbit. For example, under the action of the dihedral group D 4, the orbit of an unlabelled square is just the unlabelled square itself, since by definition the action of every element of D 4 is to leave the square unchanged, whereas the orbit of a square that is labelled so as to break its symmetry completely will contain eight distinct elements generated by the action of each of the eight elements of D 4. An equivalence class is normally represented by just one of its elements. For example, the equivalence class of all rational numbers of the form n p, where p and q are coprime integers, q is positive and n is any non-zero integer, is normally represented by the single n q element with n = 1, namely p. Similarly, we can represent each of the orbits in S under the action of G by a single element, which q reduces considerably the complexity of representing S. If necessary, we could reconstruct each complete orbit by applying each element of G to the representative of the orbit. The algorithm to reconstruct the whole of S is probably slightly more obvious than the algorithm to replace each orbit by a single representative element, although they are almost identical; the latter is for each s in S and each g in G \ I if g( s ) s then remove g( s ) from S Practical considerations The algorithm involves a double loop (over S and G \ I) and in principle it does not matter which loop is inside which, although one way may be more convenient or efficient. The following points reiterate some important remarks made earlier: It is necessary to choose a data structure to represent each element of S, and it is best if the representation is unique so that if x and y both represent the same element then necessarily x = y. This makes it much easier to remove elements from S. A representation in terms of Maple sets should satisfy this requirement, whereas a representation in terms of lists might not, because it might depend on the order in which the elements were constructed. Once a representation has been chosen for the elements of S, it is necessary to implement the elements of G as functions that map elements of S to other elements of S. The result of applying each element of G to an element s of S can be constructed efficiently and reliably by considering the formal way that the group G can be generated. In the case of the dihedral group, it is necessary only to implement functions corresponding to the two generators S and R, from which all the group elements can be constructed; multiplication of group elements corresponds to composition of the functions representing the group elements. It is tempting to use a Maple for...in loop over S, but this will probably not work because Maple for loop parameters are evaluated once only before the loop is executed. Hence the fact that elements are being removed from S as the loop runs will be ignored. At best, this is likely to be inefficient, and (more likely) at worst it will cause every element of S to be removed, because if a and b are equivalent elements of S then a will cause b to be removed and b will cause a to be removed. This problem can be avoided by using a more dynamic loop construct, such as a for...while loop that uses explicit indexing to access the elements of S and stops after it has considered the last element remaining in the current version of S. The condition in a while loop is re-evaluated before each iteration of the loop. References 4

5 [1] N. Wirth, Algorithms + Data Structures = Programs, Prentice-Hall (1976), Section 3.5. [2] N. Wirth, Programming in Modula-2, Springer-Verlag (1985), last program in Chapter 14. [3] P. H. Winston and B. K. P. Horn, LISP, Addison-Wesley (3rd ed., 1988), end of Chapter 11. [4] I. Bratko, Prolog Programming for Artificial Intelligence, Addison-Wesley (1988), Section 4.5. [5] H. S. M. Coxeter, Introduction to Geometry, Wiley (1961), Chapter 2, Sections 2.4 to 2.7. Acknowledgements I thank my colleagues Dr Prasenjit Saha for reminding me of this problem and Dr Ian Chiswell for suggesting the Coxeter reference. Mark scheme Generate a list of solution coordinates: 4 marks Remove symmetry-related solutions: 4 marks Plot a list of solutions: 4 marks Presentation and discussion: 8 marks 5

ENGR170 Assignment Problem Solving with Recursion Dr Michael M. Marefat

ENGR170 Assignment Problem Solving with Recursion Dr Michael M. Marefat ENGR170 Assignment Problem Solving with Recursion Dr Michael M. Marefat Overview The goal of this assignment is to find solutions for the 8-queen puzzle/problem. The goal is to place on a 8x8 chess board

More information

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees. 7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}

More information

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.

More information

Aesthetically Pleasing Azulejo Patterns

Aesthetically Pleasing Azulejo Patterns Bridges 2009: Mathematics, Music, Art, Architecture, Culture Aesthetically Pleasing Azulejo Patterns Russell Jay Hendel Mathematics Department, Room 312 Towson University 7800 York Road Towson, MD, 21252,

More information

Permutation Groups. Definition and Notation

Permutation Groups. Definition and Notation 5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those

More information

Lecture 2.3: Symmetric and alternating groups

Lecture 2.3: Symmetric and alternating groups Lecture 2.3: Symmetric and alternating groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)

More information

28,800 Extremely Magic 5 5 Squares Arthur Holshouser. Harold Reiter.

28,800 Extremely Magic 5 5 Squares Arthur Holshouser. Harold Reiter. 28,800 Extremely Magic 5 5 Squares Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@uncc.edu

More information

Counting Cube Colorings with the Cauchy-Frobenius Formula and Further Friday Fun

Counting Cube Colorings with the Cauchy-Frobenius Formula and Further Friday Fun Counting Cube Colorings with the Cauchy-Frobenius Formula and Further Friday Fun Daniel Frohardt Wayne State University December 3, 2010 We have a large supply of squares of in 3 different colors and an

More information

Math 3560 HW Set 6. Kara. October 17, 2013

Math 3560 HW Set 6. Kara. October 17, 2013 Math 3560 HW Set 6 Kara October 17, 013 (91) Let I be the identity matrix 1 Diagonal matrices with nonzero entries on diagonal form a group I is in the set and a 1 0 0 b 1 0 0 a 1 b 1 0 0 0 a 0 0 b 0 0

More information

CMPS 12A Introduction to Programming Programming Assignment 5 In this assignment you will write a Java program that finds all solutions to the n-queens problem, for. Begin by reading the Wikipedia article

More information

Know how to represent permutations in the two rowed notation, and how to multiply permutations using this notation.

Know how to represent permutations in the two rowed notation, and how to multiply permutations using this notation. The third exam will be on Monday, November 21, 2011. It will cover Sections 5.1-5.5. Of course, the material is cumulative, and the listed sections depend on earlier sections, which it is assumed that

More information

N-Queens Problem. Latin Squares Duncan Prince, Tamara Gomez February

N-Queens Problem. Latin Squares Duncan Prince, Tamara Gomez February N-ueens Problem Latin Squares Duncan Prince, Tamara Gomez February 19 2015 Author: Duncan Prince The N-ueens Problem The N-ueens problem originates from a question relating to chess, The 8-ueens problem

More information

Citation for published version (APA): Nutma, T. A. (2010). Kac-Moody Symmetries and Gauged Supergravity Groningen: s.n.

Citation for published version (APA): Nutma, T. A. (2010). Kac-Moody Symmetries and Gauged Supergravity Groningen: s.n. University of Groningen Kac-Moody Symmetries and Gauged Supergravity Nutma, Teake IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please

More information

GLOSSARY. a * (b * c) = (a * b) * c. A property of operations. An operation * is called associative if:

GLOSSARY. a * (b * c) = (a * b) * c. A property of operations. An operation * is called associative if: Associativity A property of operations. An operation * is called associative if: a * (b * c) = (a * b) * c for every possible a, b, and c. Axiom For Greek geometry, an axiom was a 'self-evident truth'.

More information

CSE548, AMS542: Analysis of Algorithms, Fall 2016 Date: Sep 25. Homework #1. ( Due: Oct 10 ) Figure 1: The laser game.

CSE548, AMS542: Analysis of Algorithms, Fall 2016 Date: Sep 25. Homework #1. ( Due: Oct 10 ) Figure 1: The laser game. CSE548, AMS542: Analysis of Algorithms, Fall 2016 Date: Sep 25 Homework #1 ( Due: Oct 10 ) Figure 1: The laser game. Task 1. [ 60 Points ] Laser Game Consider the following game played on an n n board,

More information

CSE 573 Problem Set 1. Answers on 10/17/08

CSE 573 Problem Set 1. Answers on 10/17/08 CSE 573 Problem Set. Answers on 0/7/08 Please work on this problem set individually. (Subsequent problem sets may allow group discussion. If any problem doesn t contain enough information for you to answer

More information

Algorithmique appliquée Projet UNO

Algorithmique appliquée Projet UNO Algorithmique appliquée Projet UNO Paul Dorbec, Cyril Gavoille The aim of this project is to encode a program as efficient as possible to find the best sequence of cards that can be played by a single

More information

Latin Squares for Elementary and Middle Grades

Latin Squares for Elementary and Middle Grades Latin Squares for Elementary and Middle Grades Yul Inn Fun Math Club email: Yul.Inn@FunMathClub.com web: www.funmathclub.com Abstract: A Latin square is a simple combinatorial object that arises in many

More information

Graphs of Tilings. Patrick Callahan, University of California Office of the President, Oakland, CA

Graphs of Tilings. Patrick Callahan, University of California Office of the President, Oakland, CA Graphs of Tilings Patrick Callahan, University of California Office of the President, Oakland, CA Phyllis Chinn, Department of Mathematics Humboldt State University, Arcata, CA Silvia Heubach, Department

More information

A Group-theoretic Approach to Human Solving Strategies in Sudoku

A Group-theoretic Approach to Human Solving Strategies in Sudoku Colonial Academic Alliance Undergraduate Research Journal Volume 3 Article 3 11-5-2012 A Group-theoretic Approach to Human Solving Strategies in Sudoku Harrison Chapman University of Georgia, hchaps@gmail.com

More information

Conway s Soldiers. Jasper Taylor

Conway s Soldiers. Jasper Taylor Conway s Soldiers Jasper Taylor And the maths problem that I did was called Conway s Soldiers. And in Conway s Soldiers you have a chessboard that continues infinitely in all directions and every square

More information

In the game of Chess a queen can move any number of spaces in any linear direction: horizontally, vertically, or along a diagonal.

In the game of Chess a queen can move any number of spaces in any linear direction: horizontally, vertically, or along a diagonal. CMPS 12A Introduction to Programming Winter 2013 Programming Assignment 5 In this assignment you will write a java program finds all solutions to the n-queens problem, for 1 n 13. Begin by reading the

More information

Unit 5 Shape and space

Unit 5 Shape and space Unit 5 Shape and space Five daily lessons Year 4 Summer term Unit Objectives Year 4 Sketch the reflection of a simple shape in a mirror line parallel to Page 106 one side (all sides parallel or perpendicular

More information

STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES

STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES FLORIAN BREUER and JOHN MICHAEL ROBSON Abstract We introduce a game called Squares where the single player is presented with a pattern of black and white

More information

Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings ÂÓÙÖÒÐ Ó ÖÔ ÐÓÖØÑ Ò ÔÔÐØÓÒ ØØÔ»»ÛÛÛº ºÖÓÛÒºÙ»ÔÙÐØÓÒ»» vol.?, no.?, pp. 1 44 (????) Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings David R. Wood School of Computer Science

More information

37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game

37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game 37 Game Theory Game theory is one of the most interesting topics of discrete mathematics. The principal theorem of game theory is sublime and wonderful. We will merely assume this theorem and use it to

More information

Reflections on the N + k Queens Problem

Reflections on the N + k Queens Problem Integre Technical Publishing Co., Inc. College Mathematics Journal 40:3 March 12, 2009 2:02 p.m. chatham.tex page 204 Reflections on the N + k Queens Problem R. Douglas Chatham R. Douglas Chatham (d.chatham@moreheadstate.edu)

More information

5 Symmetric and alternating groups

5 Symmetric and alternating groups MTHM024/MTH714U Group Theory Notes 5 Autumn 2011 5 Symmetric and alternating groups In this section we examine the alternating groups A n (which are simple for n 5), prove that A 5 is the unique simple

More information

Three of these grids share a property that the other three do not. Can you find such a property? + mod

Three of these grids share a property that the other three do not. Can you find such a property? + mod PPMTC 22 Session 6: Mad Vet Puzzles Session 6: Mad Veterinarian Puzzles There is a collection of problems that have come to be known as "Mad Veterinarian Puzzles", for reasons which will soon become obvious.

More information

5.4 Imperfect, Real-Time Decisions

5.4 Imperfect, Real-Time Decisions 5.4 Imperfect, Real-Time Decisions Searching through the whole (pruned) game tree is too inefficient for any realistic game Moves must be made in a reasonable amount of time One has to cut off the generation

More information

Permutations with short monotone subsequences

Permutations with short monotone subsequences Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres

More information

Some results on Su Doku

Some results on Su Doku Some results on Su Doku Sourendu Gupta March 2, 2006 1 Proofs of widely known facts Definition 1. A Su Doku grid contains M M cells laid out in a square with M cells to each side. Definition 2. For every

More information

MATH CIRCLE, 10/13/2018

MATH CIRCLE, 10/13/2018 MATH CIRCLE, 10/13/2018 LARGE SOLUTIONS 1. Write out row 8 of Pascal s triangle. Solution. 1 8 28 56 70 56 28 8 1. 2. Write out all the different ways you can choose three letters from the set {a, b, c,

More information

ON THE ENUMERATION OF MAGIC CUBES*

ON THE ENUMERATION OF MAGIC CUBES* 1934-1 ENUMERATION OF MAGIC CUBES 833 ON THE ENUMERATION OF MAGIC CUBES* BY D. N. LEHMER 1. Introduction. Assume the cube with one corner at the origin and the three edges at that corner as axes of reference.

More information

Tile Number and Space-Efficient Knot Mosaics

Tile Number and Space-Efficient Knot Mosaics Tile Number and Space-Efficient Knot Mosaics Aaron Heap and Douglas Knowles arxiv:1702.06462v1 [math.gt] 21 Feb 2017 February 22, 2017 Abstract In this paper we introduce the concept of a space-efficient

More information

The patterns considered here are black and white and represented by a rectangular grid of cells. Here is a typical pattern: [Redundant]

The patterns considered here are black and white and represented by a rectangular grid of cells. Here is a typical pattern: [Redundant] Pattern Tours The patterns considered here are black and white and represented by a rectangular grid of cells. Here is a typical pattern: [Redundant] A sequence of cell locations is called a path. A path

More information

More Recursion: NQueens

More Recursion: NQueens More Recursion: NQueens continuation of the recursion topic notes on the NQueens problem an extended example of a recursive solution CISC 121 Summer 2006 Recursion & Backtracking 1 backtracking Recursion

More information

Lecture 20: Combinatorial Search (1997) Steven Skiena. skiena

Lecture 20: Combinatorial Search (1997) Steven Skiena.   skiena Lecture 20: Combinatorial Search (1997) Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Give an O(n lg k)-time algorithm

More information

Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 2016 [(3!)!] 4

Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 2016 [(3!)!] 4 Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 206 Rules: Three hours; no electronic devices. The positive integers are, 2, 3, 4,.... Pythagorean Triplet The sum of the lengths of the

More information

General Functions and Graphs

General Functions and Graphs General Functions and Graphs Section 7 Functions Graphs and Symmetry Functions can be represented both as algebraic expressions and as graphs. So far we have concentrated on algebraic operations related

More information

Econ 172A - Slides from Lecture 18

Econ 172A - Slides from Lecture 18 1 Econ 172A - Slides from Lecture 18 Joel Sobel December 4, 2012 2 Announcements 8-10 this evening (December 4) in York Hall 2262 I ll run a review session here (Solis 107) from 12:30-2 on Saturday. Quiz

More information

Recovery and Characterization of Non-Planar Resistor Networks

Recovery and Characterization of Non-Planar Resistor Networks Recovery and Characterization of Non-Planar Resistor Networks Julie Rowlett August 14, 1998 1 Introduction In this paper we consider non-planar conductor networks. A conductor is a two-sided object which

More information

Dyck paths, standard Young tableaux, and pattern avoiding permutations

Dyck paths, standard Young tableaux, and pattern avoiding permutations PU. M. A. Vol. 21 (2010), No.2, pp. 265 284 Dyck paths, standard Young tableaux, and pattern avoiding permutations Hilmar Haukur Gudmundsson The Mathematics Institute Reykjavik University Iceland e-mail:

More information

Symmetric Permutations Avoiding Two Patterns

Symmetric Permutations Avoiding Two Patterns Symmetric Permutations Avoiding Two Patterns David Lonoff and Jonah Ostroff Carleton College Northfield, MN 55057 USA November 30, 2008 Abstract Symmetric pattern-avoiding permutations are restricted permutations

More information

Mathematics of Magic Squares and Sudoku

Mathematics of Magic Squares and Sudoku Mathematics of Magic Squares and Sudoku Introduction This article explains How to create large magic squares (large number of rows and columns and large dimensions) How to convert a four dimensional magic

More information

8. You Won t Want To Play Sudoku Again

8. You Won t Want To Play Sudoku Again 8. You Won t Want To Play Sudoku Again Thanks to modern computers, brawn beats brain. Programming constructs and algorithmic paradigms covered in this puzzle: Global variables. Sets and set operations.

More information

An Optimal Algorithm for a Strategy Game

An Optimal Algorithm for a Strategy Game International Conference on Materials Engineering and Information Technology Applications (MEITA 2015) An Optimal Algorithm for a Strategy Game Daxin Zhu 1, a and Xiaodong Wang 2,b* 1 Quanzhou Normal University,

More information

Techniques for Generating Sudoku Instances

Techniques for Generating Sudoku Instances Chapter Techniques for Generating Sudoku Instances Overview Sudoku puzzles become worldwide popular among many players in different intellectual levels. In this chapter, we are going to discuss different

More information

Grade 7/8 Math Circles. Visual Group Theory

Grade 7/8 Math Circles. Visual Group Theory Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles October 25 th /26 th Visual Group Theory Grouping Concepts Together We will start

More information

THE SIGN OF A PERMUTATION

THE SIGN OF A PERMUTATION THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written

More information

Laboratory 1: Uncertainty Analysis

Laboratory 1: Uncertainty Analysis University of Alabama Department of Physics and Astronomy PH101 / LeClair May 26, 2014 Laboratory 1: Uncertainty Analysis Hypothesis: A statistical analysis including both mean and standard deviation can

More information

Follow each step of the procedure to fold a strip of 10 equilateral triangles into a flexagon with 3 faces.

Follow each step of the procedure to fold a strip of 10 equilateral triangles into a flexagon with 3 faces. Assignment 1 Start with an arbitrary folding line on your paper roll. Do action Folding Up (U) to create a new folding line Do action Folding down (D) to create a new folding line Repeat this (doing U,

More information

arxiv: v2 [math.gt] 21 Mar 2018

arxiv: v2 [math.gt] 21 Mar 2018 Tile Number and Space-Efficient Knot Mosaics arxiv:1702.06462v2 [math.gt] 21 Mar 2018 Aaron Heap and Douglas Knowles March 22, 2018 Abstract In this paper we introduce the concept of a space-efficient

More information

Asymptotic Results for the Queen Packing Problem

Asymptotic Results for the Queen Packing Problem Asymptotic Results for the Queen Packing Problem Daniel M. Kane March 13, 2017 1 Introduction A classic chess problem is that of placing 8 queens on a standard board so that no two attack each other. This

More information

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors. Permutation Groups 5-9-2013 A permutation of a set X is a bijective function σ : X X The set of permutations S X of a set X forms a group under function composition The group of permutations of {1,2,,n}

More information

18.204: CHIP FIRING GAMES

18.204: CHIP FIRING GAMES 18.204: CHIP FIRING GAMES ANNE KELLEY Abstract. Chip firing is a one-player game where piles start with an initial number of chips and any pile with at least two chips can send one chip to the piles on

More information

Permutations and codes:

Permutations and codes: Hamming distance Permutations and codes: Polynomials, bases, and covering radius Peter J. Cameron Queen Mary, University of London p.j.cameron@qmw.ac.uk International Conference on Graph Theory Bled, 22

More information

Sudoku an alternative history

Sudoku an alternative history Sudoku an alternative history Peter J. Cameron p.j.cameron@qmul.ac.uk Talk to the Archimedeans, February 2007 Sudoku There s no mathematics involved. Use logic and reasoning to solve the puzzle. Instructions

More information

SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS

SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #G04 SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS Vincent D. Blondel Department of Mathematical Engineering, Université catholique

More information

arxiv: v2 [math.ho] 23 Aug 2018

arxiv: v2 [math.ho] 23 Aug 2018 Mathematics of a Sudo-Kurve arxiv:1808.06713v2 [math.ho] 23 Aug 2018 Tanya Khovanova Abstract Wayne Zhao We investigate a type of a Sudoku variant called Sudo-Kurve, which allows bent rows and columns,

More information

Permutations. = f 1 f = I A

Permutations. = f 1 f = I A Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has

More information

Two Parity Puzzles Related to Generalized Space-Filling Peano Curve Constructions and Some Beautiful Silk Scarves

Two Parity Puzzles Related to Generalized Space-Filling Peano Curve Constructions and Some Beautiful Silk Scarves Two Parity Puzzles Related to Generalized Space-Filling Peano Curve Constructions and Some Beautiful Silk Scarves http://www.dmck.us Here is a simple puzzle, related not just to the dawn of modern mathematics

More information

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining

More information

Goal-Directed Tableaux

Goal-Directed Tableaux Goal-Directed Tableaux Joke Meheus and Kristof De Clercq Centre for Logic and Philosophy of Science University of Ghent, Belgium Joke.Meheus,Kristof.DeClercq@UGent.be October 21, 2008 Abstract This paper

More information

Six stages with rational Numbers (Published in Mathematics in School, Volume 30, Number 1, January 2001.)

Six stages with rational Numbers (Published in Mathematics in School, Volume 30, Number 1, January 2001.) Six stages with rational Numbers (Published in Mathematics in School, Volume 0, Number 1, January 2001.) Stage 1. Free Interaction. We come across the implicit idea of ratio quite early in life, without

More information

Exploring Concepts with Cubes. A resource book

Exploring Concepts with Cubes. A resource book Exploring Concepts with Cubes A resource book ACTIVITY 1 Gauss s method Gauss s method is a fast and efficient way of determining the sum of an arithmetic series. Let s illustrate the method using the

More information

LESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE

LESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE LESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE The inclusion-exclusion principle (also known as the sieve principle) is an extended version of the rule of the sum. It states that, for two (finite) sets, A

More information

Determining MTF with a Slant Edge Target ABSTRACT AND INTRODUCTION

Determining MTF with a Slant Edge Target ABSTRACT AND INTRODUCTION Determining MTF with a Slant Edge Target Douglas A. Kerr Issue 2 October 13, 2010 ABSTRACT AND INTRODUCTION The modulation transfer function (MTF) of a photographic lens tells us how effectively the lens

More information

arxiv: v1 [math.gt] 21 Mar 2018

arxiv: v1 [math.gt] 21 Mar 2018 Space-Efficient Knot Mosaics for Prime Knots with Mosaic Number 6 arxiv:1803.08004v1 [math.gt] 21 Mar 2018 Aaron Heap and Douglas Knowles June 24, 2018 Abstract In 2008, Kauffman and Lomonaco introduce

More information

MATHEMATICS ON THE CHESSBOARD

MATHEMATICS ON THE CHESSBOARD MATHEMATICS ON THE CHESSBOARD Problem 1. Consider a 8 8 chessboard and remove two diametrically opposite corner unit squares. Is it possible to cover (without overlapping) the remaining 62 unit squares

More information

Modular Arithmetic. Kieran Cooney - February 18, 2016

Modular Arithmetic. Kieran Cooney - February 18, 2016 Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.

More information

X = {1, 2,...,n} n 1f 2f 3f... nf

X = {1, 2,...,n} n 1f 2f 3f... nf Section 11 Permutations Definition 11.1 Let X be a non-empty set. A bijective function f : X X will be called a permutation of X. Consider the case when X is the finite set with n elements: X {1, 2,...,n}.

More information

A GRAPH THEORETICAL APPROACH TO SOLVING SCRAMBLE SQUARES PUZZLES. 1. Introduction

A GRAPH THEORETICAL APPROACH TO SOLVING SCRAMBLE SQUARES PUZZLES. 1. Introduction GRPH THEORETICL PPROCH TO SOLVING SCRMLE SQURES PUZZLES SRH MSON ND MLI ZHNG bstract. Scramble Squares puzzle is made up of nine square pieces such that each edge of each piece contains half of an image.

More information

Solutions to Exercises Chapter 6: Latin squares and SDRs

Solutions to Exercises Chapter 6: Latin squares and SDRs Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,

More information

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA JOEL LOUWSMA, ADILSON EDUARDO PRESOTO, AND ALAN TARR Abstract. Krakowski and Regev found a basis of polynomial identities satisfied

More information

Rotational Puzzles on Graphs

Rotational Puzzles on Graphs Rotational Puzzles on Graphs On this page I will discuss various graph puzzles, or rather, permutation puzzles consisting of partially overlapping cycles. This was first investigated by R.M. Wilson in

More information

An Intuitive Approach to Groups

An Intuitive Approach to Groups Chapter An Intuitive Approach to Groups One of the major topics of this course is groups. The area of mathematics that is concerned with groups is called group theory. Loosely speaking, group theory is

More information

New designs from Africa

New designs from Africa 1997 2009, Millennium Mathematics Project, University of Cambridge. Permission is granted to print and copy this page on paper for non commercial use. For other uses, including electronic redistribution,

More information

Introduction to Pentominoes. Pentominoes

Introduction to Pentominoes. Pentominoes Pentominoes Pentominoes are those shapes consisting of five congruent squares joined edge-to-edge. It is not difficult to show that there are only twelve possible pentominoes, shown below. In the literature,

More information

arxiv: v1 [math.ho] 26 Jan 2013

arxiv: v1 [math.ho] 26 Jan 2013 SPOT IT! R SOLITAIRE DONNA A. DIETZ DEPARTMENT OF MATHEMATICS AND STATISTICS AMERICAN UNIVERSITY WASHINGTON, DC, USA arxiv:1301.7058v1 [math.ho] 26 Jan 2013 Abstract. The game of Spot it R is based on

More information

a b c d e f g h i j k l m n

a b c d e f g h i j k l m n Shoebox, page 1 In his book Chess Variants & Games, A. V. Murali suggests playing chess on the exterior surface of a cube. This playing surface has intriguing properties: We can think of it as three interlocked

More information

Ian Stewart. 8 Whitefield Close Westwood Heath Coventry CV4 8GY UK

Ian Stewart. 8 Whitefield Close Westwood Heath Coventry CV4 8GY UK Choosily Chomping Chocolate Ian Stewart 8 Whitefield Close Westwood Heath Coventry CV4 8GY UK Just because a game has simple rules, that doesn't imply that there must be a simple strategy for winning it.

More information

arxiv: v1 [cs.cc] 21 Jun 2017

arxiv: v1 [cs.cc] 21 Jun 2017 Solving the Rubik s Cube Optimally is NP-complete Erik D. Demaine Sarah Eisenstat Mikhail Rudoy arxiv:1706.06708v1 [cs.cc] 21 Jun 2017 Abstract In this paper, we prove that optimally solving an n n n Rubik

More information

CIS 2033 Lecture 6, Spring 2017

CIS 2033 Lecture 6, Spring 2017 CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,

More information

1 Running the Program

1 Running the Program GNUbik Copyright c 1998,2003 John Darrington 2004 John Darrington, Dale Mellor Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission

More information

UNDECIDABILITY AND APERIODICITY OF TILINGS OF THE PLANE

UNDECIDABILITY AND APERIODICITY OF TILINGS OF THE PLANE UNDECIDABILITY AND APERIODICITY OF TILINGS OF THE PLANE A Thesis to be submitted to the University of Leicester in partial fulllment of the requirements for the degree of Master of Mathematics. by Hendy

More information

The Fano Plane as an Octonionic Multiplication Table

The Fano Plane as an Octonionic Multiplication Table The Fano Plane as an Octonionic Multiplication Table Peter Killgore June 9, 2014 1 Introduction When considering finite geometries, an obvious question to ask is what applications such geometries have.

More information

Mathematics Competition Practice Session 6. Hagerstown Community College: STEM Club November 20, :00 pm - 1:00 pm STC-170

Mathematics Competition Practice Session 6. Hagerstown Community College: STEM Club November 20, :00 pm - 1:00 pm STC-170 2015-2016 Mathematics Competition Practice Session 6 Hagerstown Community College: STEM Club November 20, 2015 12:00 pm - 1:00 pm STC-170 1 Warm-Up (2006 AMC 10B No. 17): Bob and Alice each have a bag

More information

Design of Parallel Algorithms. Communication Algorithms

Design of Parallel Algorithms. Communication Algorithms + Design of Parallel Algorithms Communication Algorithms + Topic Overview n One-to-All Broadcast and All-to-One Reduction n All-to-All Broadcast and Reduction n All-Reduce and Prefix-Sum Operations n Scatter

More information

A theorem on the cores of partitions

A theorem on the cores of partitions A theorem on the cores of partitions Jørn B. Olsson Department of Mathematical Sciences, University of Copenhagen Universitetsparken 5,DK-2100 Copenhagen Ø, Denmark August 9, 2008 Abstract: If s and t

More information

1 Introduction. 2 An Easy Start. KenKen. Charlotte Teachers Institute, 2015

1 Introduction. 2 An Easy Start. KenKen. Charlotte Teachers Institute, 2015 1 Introduction R is a puzzle whose solution requires a combination of logic and simple arithmetic and combinatorial skills 1 The puzzles range in difficulty from very simple to incredibly difficult Students

More information

Some t-homogeneous sets of permutations

Some t-homogeneous sets of permutations Some t-homogeneous sets of permutations Jürgen Bierbrauer Department of Mathematical Sciences Michigan Technological University Houghton, MI 49931 (USA) Stephen Black IBM Heidelberg (Germany) Yves Edel

More information

Eight Queens Puzzle Solution Using MATLAB EE2013 Project

Eight Queens Puzzle Solution Using MATLAB EE2013 Project Eight Queens Puzzle Solution Using MATLAB EE2013 Project Matric No: U066584J January 20, 2010 1 Introduction Figure 1: One of the Solution for Eight Queens Puzzle The eight queens puzzle is the problem

More information

Universiteit Leiden Opleiding Informatica

Universiteit Leiden Opleiding Informatica Universiteit Leiden Opleiding Informatica Solving and Constructing Kamaji Puzzles Name: Kelvin Kleijn Date: 27/08/2018 1st supervisor: dr. Jeanette de Graaf 2nd supervisor: dr. Walter Kosters BACHELOR

More information

On the isomorphism problem of Coxeter groups and related topics

On the isomorphism problem of Coxeter groups and related topics On the isomorphism problem of Coxeter groups and related topics Koji Nuida 1 Graduate School of Mathematical Sciences, University of Tokyo E-mail: nuida@ms.u-tokyo.ac.jp At the conference the author gives

More information

Greedy Flipping of Pancakes and Burnt Pancakes

Greedy Flipping of Pancakes and Burnt Pancakes Greedy Flipping of Pancakes and Burnt Pancakes Joe Sawada a, Aaron Williams b a School of Computer Science, University of Guelph, Canada. Research supported by NSERC. b Department of Mathematics and Statistics,

More information

Wythoff s Game. Kimberly Hirschfeld-Cotton Oshkosh, Nebraska

Wythoff s Game. Kimberly Hirschfeld-Cotton Oshkosh, Nebraska Wythoff s Game Kimberly Hirschfeld-Cotton Oshkosh, Nebraska In partial fulfillment of the requirements for the Master of Arts in Teaching with a Specialization in the Teaching of Middle Level Mathematics

More information

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University

More information

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 23 The Phase Locked Loop (Contd.) We will now continue our discussion

More information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 20. Combinatorial Optimization: Introduction and Hill-Climbing Malte Helmert Universität Basel April 8, 2016 Combinatorial Optimization Introduction previous chapters:

More information