Westminster College 2012 High School Programming Contest. October 8, 2012
|
|
- Margery Knight
- 5 years ago
- Views:
Transcription
1 Westminster College 01 High School Programming Contest October, 01 Rules: 1. There are six questions to be completed in two and 1/ hours.. All questions require you to read the test data from standard input and write results to standard output. You should not use files for input or output.. The allowed programming languages are C++ and Java.. All programs will be re-compiled prior to testing with the judges data.. Programming style is not considered in this contest. You are free to code in whatever style you prefer. Documentation is not required. 6. Judges decisions are final. No cheating will be tolerated.
2 01 Westminster High School Programming Contest 1 Problem A: The n + 1 problem The n + 1 problem is a very interesting mathematical problem which goes as follows: start with any positive integer n, and then do one of the following: 1. if n is even, replace n with n/.. if n is odd, replace n with n + 1. So, if you start with n =, you would first replace it with / = 19. Next you would replace 19 with (19) + 1 =. This, in turn, would be replaced by 9, which is replaced by, and so on. That s it. So where s the very interesting part you ask? Well, for every starting positive number n that s ever been tried, this procedure eventually generates 1. Using the example above, the series of numbers generated is And the REALLY interesting thing about it is that no one has yet been able to prove that this will ALWAYS be the case for any positive integer n (the problem was first posed by L. Collatz in 197 and remains one of the most famous unanswered questions in mathematics). Now, needless to say, I m not asking you to prove the n + 1 problem, but I am asking you to implement it. The input file will consist of multiple test cases. Each case consists of a single positive integer n. The maximum value for n will be 100,000,000 (NOTE: C++ users, you ll want to use the type long long for n, not int or long; Java users should use the type long). A line containing a single 0 will terminate input. For each test case, output the case number followed by the number of times you had to replace the starting number until you get to Case 1: 1 Case : 1 Case : 10
3 01 Westminster High School Programming Contest Problem B: I m Asking You to Check, Mate The game of chess is played on an board, and each side has 16 pieces consisting of kings, queens, rooks, bishops, knights and pawns (we ll ignore pawns for this problem). Each piece has a unique way to move on the board as follows: the queen is the most powerful piece, and can move to any square in the same row, column or diagonal which it is currently on, as shown in the first figure below: the queen on square (,) can move to squares (,), (,7), (,) and a host of others ( all together). This figure also shows how the king moves. It too can move in any direction, but only one square at a time. The rook can only move in the same row or column it is currently on, and the bishop can only move on a diagonal which is currently on (see figure ). The strangest piece is the knight, which moves in an L-shaped manner squares in any direction along its row or column, and then 1 square in a direction at right angles to this (see figure we will use N for a knight, since K is already used for the king) K Q Figure R B Figure N Figure If any of your opponent s pieces are on a square that one of your pieces can move to, it is under attack, meaning that your piece can move to that square and remove the opposing piece from the board. The object of a game of chess is to checkmate the opposing king, which occurs when 1. the opposing king is under attack (i.e., one of you pieces could move to the king s position), and. every possible square the king could move to is also under attack. For example, the opposing king (the circled K) in Fig below is checkmated: it is currently under attack by your queen, and can t move to any safe square because of your queen, rooks and the knight. The king in Fig is not checkmated, as it can move safely to squares (, ) or (, 6) since none of your pieces are attacking either of those squares Q R K N R Figure Q R K N Figure
4 01 Westminster High School Programming Contest For this problem, you will read in the positions of several of your pieces and the position of the opposing king and must determine whether or not the opposing king has been checkmated. There will be multiple test cases. Each test case will start with a line containing a positive integer n indicating the number of total pieces on the board (n-1 of your pieces and 1 opposing king). Following that will be n lines, each containing a single character following by a pair of integers. The single character identifies the type of piece (either K, Q, R, B or N ) and the pair of integers specifies the column and row location of the piece. The opposing king will always be the last piece specified. Unlike real chess, there can be any number of your kings, queens, rooks, bishops and knights on the board, but there will always be only one opposing king. You may also assume that none of your pieces is next to the opposing king, and that no piece gets in the way of any other piece. A single 0 will terminate input. The two sample inputs below correspond to figures and above. For each test case, output the case number followed by either Yes if the king is checkmated, or No m if the king is not checkmated and has m safe squares to move to. Q R 1 R 7 7 N 6 K 6 Q R 7 7 N 6 K 6 0 Case 1: Yes Case : No
5 01 Westminster High School Programming Contest Problem C: It All Adds Up The number 1 can be written as the sum of consecutive positive integers in two different ways: 1 = +6 and 1= Hey wait, there s a third way! 1 = Neat! Sounds like an idea for a programming problem! The input file will consist of multiple test cases. Each case consists of a single positive integer n. The maximum value for n will be 100,000. A line containing a single 0 will terminate input. For each test case, output the case number and an integer m indicating the number of ways which the value of n for that problem can be broken down to a sum of consecutive integers (we ll call each of these sums a partition). After this, output the m partitions, one per line, in the form a b where a + (a + 1) + (a + ) + + b is one of the ways to get n. the partition with the smallest a value first, then the next smallest, etc. 1 0 Case 1: Case : 0 Case : 1 10
6 01 Westminster High School Programming Contest Problem D: Scoooooooooooooore! You work for an on-line newspaper called The Daily Blab and have one and only one job: to post football scores once the games are over. You have an assistant at each game who tweets every time some team scores. To keep things simple (and within the 10 character limit), your assistant only tweets the first letter of the scoring team s name, and what they did to score. In (American) football there are five ways to score points: a touchdown, worth 6 points; an extra point, worth 1 point; a two-point conversion worth (what else) points; a field goal, worth points; and a safety, worth points (actually, there s a sixth way as well do any of you know what it is?). So if the Steelers are playing the Ravens, a tweet might look like S T, meaning the Steelers scored a touchdown, or R F meaning the Ravens scored a field goal (no matter how unlikely). An E, C and an S are used to indicate an extra point, a two-point conversion and a safety. After the game is over you can use these tweets to determine the final score, which you then post. For example, if you got the tweets S T, S E, R F, S F, S S, you would post Steelers 1, Ravens. The input file will consist of multiple games. The input file starts with an integer n indicating the number of games. Each game starts with a line containing the team names, which always start with different letters. Following this will be the tweets, one per line. Each tweet will consist of two characters separated by a space. For all but the last tweet the first character will be one of the two starting characters for the team name, and the second character will be either T, E, C, F or S. All characters will be uppercase. The last tweet in each game will be $ $ indicating the game is over. For each game output the game number followed by the winning teams name and score, and the losing teams name and score, each separated by a single space. There will never be a tie game. Steelers Ravens S T S E R F S F S S $ $ Cowboys Redskins R T R T R T R T $ $ Game 1: Steelers 1 Ravens Game : Redskins Cowboys 0
7 01 Westminster High School Programming Contest 6 Problem E: And Speaking of Tweets You are all well aware of the Twitter phenomenon, and the fact that tweets can only be 10 characters long. You ve just been promoted to Head Twit at a spinoff company called Twitter Lite which only allows 0 characters per tweet. Your job is to enforce this limit. You read each users tweets and truncate them if they go over the 0 character limit. To make up for their smaller tweet size, Twitter Lite has a somewhat more lenient policy as to what counts as a character, only counting non-whitespace characters towards the total (i.e., they don t count spaces, tabs or new-line characters). The input file will consist of multiple test cases. The first line will contain an integer n indicating the number of test cases. Each test case will be on a single line and will contain only alphanumeric characters, punctuation and spaces. There will never be two or more consecutive spaces in any line. For each test case output the first message as written up to and including the 0th character (not counting spaces). If the message is less than 0 characters to start with, just output the message in its entirety. This is a short tweet that won t get truncated. This tweet contains 70 characters so it will get truncated before it gets to the end. This is a short tweet that won t get truncated. This tweet contains 70 characters so it will get truncated b Reading in Lines C++: To read in an entire line into a string variable s use the global function getline() found in the string library. #include <string> using namespace std;... string s;... getline(cin,s); Java: To read in an entire line into a String variable s, use the nextline method of a Scanner object. import java.util.scanner;... Scanner in = new Scanner(System.in); String s;... s = in.nextline();
8 01 Westminster High School Programming Contest 7
9 01 Westminster High School Programming Contest Problem F: You ve Got Nothing to Hit but the Heights Brock Buster is a big-time Hollywood director who s looking for three actors for his next film to play the roles of the crotchety yet loveable grandfather, the hard-driven and neglectful father, and the winsome but hard-as-nails son. Brock has a specific image in his head about the relative heights for these roles. He wants the grandfather to be inches taller than the father, who in turn should be 6 inches taller than the son. This is a MUST (along with the fresh papaya-and-sprouts smoothie Brock demands each morning before filming). You re in charge of the casting call, and you figure the first thing you have to do is to satisfy Brock s height requirements. You have the portfolios of everyone who wants to audition, and from this you want to pull out all the groups of three actors who have the appropriate heights. This has turned out to be a little harder than you planned, so you decide to write a program to do it for you (Wow! Hollywood casting agent AND computer programmer you must be pretty talented!). The input file will consist of multiple test cases. Each case starts with an integer n 00 indicating the number of actors auditioning for the rolls. After this are n lines of the form name height where name is the name of the actor and height is the actor s height in inches. Each name will be a single word and no two actors will have the same height. A line with a single zero will terminate input. For each test case, output the case number on a single line, following by one line for each appropriate group of actors. Within each group, print the tallest person s name first, followed by the name of the next tallest and then the shortest person s name. Separate each name with a single blank. Print the tallest group first, i.e. the group with the tallest first person, followed by the second tallest group, etc. Follow the format shown below.
10 01 Westminster High School Programming Contest 9 Ford 61 Depp 69 DiCaprio 6 Hanks 71 Pitt 70 Statham 6 Smith 7 Chan 67 Nicholson 70 Willis 6 Crowe 66 McGregor 6 Bale 0 Stallone 6 Freeman 9 0 Case 1: Smith Depp DiCaprio Pitt Chan Ford Case : Case : Freeman Stallone Bale
Chess Handbook: Course One
Chess Handbook: Course One 2012 Vision Academy All Rights Reserved No Reproduction Without Permission WELCOME! Welcome to The Vision Academy! We are pleased to help you learn Chess, one of the world s
More informationUnit. The double attack. Types of double attack. With which pieces? Notes and observations
Unit The double attack Types of double attack With which pieces? Notes and observations Think Colour in the drawing with the colours of your choice. These types of drawings are called mandalas. They are
More informationYourTurnMyTurn.com: chess rules. Jan Willem Schoonhoven Copyright 2018 YourTurnMyTurn.com
YourTurnMyTurn.com: chess rules Jan Willem Schoonhoven Copyright 2018 YourTurnMyTurn.com Inhoud Chess rules...1 The object of chess...1 The board...1 Moves...1 Captures...1 Movement of the different pieces...2
More informationStructured Programming Using Procedural Languages INSS Spring 2018
Structured Programming Using Procedural Languages INSS 225.101 - Spring 2018 Project #3 (Individual) For your third project, you are going to write a program like what you did for Project 2. You are going
More informationChapter 1: Positional Play
Chapter 1: Positional Play Positional play is the Bogey-man of many chess players, who feel that it is beyond their understanding. However, this subject isn t really hard to grasp if you break it down.
More informationTHE COMPLETE RULES OF TIME-CUBE CHESS
THE COMPLETE RULES OF TIME-CUBE CHESS First edition You will need: 1. Seven full chess sets. Each set will have a separate numbering from left to rightthe leftmost pawn of each set is #1; the rightmost
More informationAfter learning the Rules, What should beginners learn next?
After learning the Rules, What should beginners learn next? Chess Puzzling Presentation Nancy Randolph Capital Conference June 21, 2016 Name Introduction to Chess Test 1. How many squares does a chess
More informationMovement of the pieces
Movement of the pieces Rook The rook moves in a straight line, horizontally or vertically. The rook may not jump over other pieces, that is: all squares between the square where the rook starts its move
More informationOCTAGON 5 IN 1 GAME SET
OCTAGON 5 IN 1 GAME SET CHESS, CHECKERS, BACKGAMMON, DOMINOES AND POKER DICE Replacement Parts Order direct at or call our Customer Service department at (800) 225-7593 8 am to 4:30 pm Central Standard
More informationIf a pawn is still on its original square, it can move two squares or one square ahead. Pawn Movement
Chess Basics Pawn Review If a pawn is still on its original square, it can move two squares or one square ahead. Pawn Movement If any piece is in the square in front of the pawn, then it can t move forward
More informationAll games have an opening. Most games have a middle game. Some games have an ending.
Chess Openings INTRODUCTION A game of chess has three parts. 1. The OPENING: the start of the game when you decide where to put your pieces 2. The MIDDLE GAME: what happens once you ve got your pieces
More informationLEARN TO PLAY CHESS CONTENTS 1 INTRODUCTION. Terry Marris December 2004
LEARN TO PLAY CHESS Terry Marris December 2004 CONTENTS 1 Kings and Queens 2 The Rooks 3 The Bishops 4 The Pawns 5 The Knights 6 How to Play 1 INTRODUCTION Chess is a game of war. You have pieces that
More informationSponsored by IBM. 2. All programs will be re-compiled prior to testing with the judges data.
ACM International Collegiate Programming Contest 22 East Central Regional Contest Ashland University University of Cincinnati Western Michigan University Sheridan University November 9, 22 Sponsored by
More informationBALDWIN WALLACE UNIVERSITY 2013 PROGRAMMING CONTEST
BALDWIN WALLACE UNIVERSITY 2013 PROGRAMMING CONTEST DO NOT OPEN UNTIL INSTRUCTED TO DO SO! Mystery Message Marvin the Paranoid Android needs to send an encrypted message to Arthur Den. Marvin is absurdly
More informationCHESS IN SCHOOLS DO WE TEACH IT THE RIGHT WAY?
CHESS IN SCHOOLS DO WE TEACH IT THE RIGHT WAY? WHY THE HELL DID OUR TEACHER USE TO TAKE US TO THE SWIMMING POOL EVERY WEEK? (AND WE DIDN T LIKE IT TOO MUCH) She wanted us to swim as fast as possible She
More informationDELUXE 3 IN 1 GAME SET
Chess, Checkers and Backgammon August 2012 UPC Code 7-19265-51276-9 HOW TO PLAY CHESS Chess Includes: 16 Dark Chess Pieces 16 Light Chess Pieces Board Start Up Chess is a game played by two players. One
More informationOPENING IDEA 3: THE KNIGHT AND BISHOP ATTACK
OPENING IDEA 3: THE KNIGHT AND BISHOP ATTACK If you play your knight to f3 and your bishop to c4 at the start of the game you ll often have the chance to go for a quick attack on f7 by moving your knight
More informationTactics Time. Interviews w/ Chess Gurus John Herron Interview Tim Brennan
Tactics Time Interviews w/ Chess Gurus John Herron Interview Tim Brennan 12 John Herron Interview Timothy Brennan: Hello, this is Tim with http://tacticstime.com and today I have a very special guest,
More informationSGU 149. Computer Network. time limit per test: 0.50 sec. memory limit per test: 4096 KB input: standard input output: standard output
SGU 149. Computer Network time limit per test: 0.50 sec. memory limit per test: 4096 KB input: standard input output: standard output A school bought the first computer some time ago. During the recent
More informationWelcome to the Brain Games Chess Help File.
HELP FILE Welcome to the Brain Games Chess Help File. Chess a competitive strategy game dating back to the 15 th century helps to developer strategic thinking skills, memorization, and visualization of
More informationGICAA State Chess Tournament
GICAA State Chess Tournament v 1. 3, 1 1 / 2 8 / 2 0 1 7 Date: 1/30/2018 Location: Grace Fellowship of Greensboro 1971 S. Main St. Greensboro, GA Agenda 8:00 Registration Opens 8:30 Coach s meeting 8:45
More informationMore Adversarial Search
More Adversarial Search CS151 David Kauchak Fall 2010 http://xkcd.com/761/ Some material borrowed from : Sara Owsley Sood and others Admin Written 2 posted Machine requirements for mancala Most of the
More informationWinning Chess Strategies
Winning Chess Strategies 1 / 6 2 / 6 3 / 6 Winning Chess Strategies Well, the strategies are good practices which can create advantages to you, but how you convert those advantages into a win depends a
More informationGrade 6 Math Circles Combinatorial Games November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games November 3/4, 2015 Chomp Chomp is a simple 2-player game. There
More informationA1 Problem Statement Unit Pricing
A1 Problem Statement Unit Pricing Given up to 10 items (weight in ounces and cost in dollars) determine which one by order (e.g. third) is the cheapest item in terms of cost per ounce. Also output the
More informationNSCL LUDI CHESS RULES
NSCL LUDI CHESS RULES 1. The Board 1.1. The board is an 8x8 square grid of alternating colors. 1.2. The board is set up according to the following diagram. Note that the queen is placed on her own color,
More informationThe game of Paco Ŝako
The game of Paco Ŝako Created to be an expression of peace, friendship and collaboration, Paco Ŝako is a new and dynamic chess game, with a mindful touch, and a mind-blowing gameplay. Two players sitting
More informationThe Basic Rules of Chess
Introduction The Basic Rules of Chess One of the questions parents of young children frequently ask Chess coaches is: How old does my child have to be to learn chess? I have personally taught over 500
More informationGrade 7/8 Math Circles Game Theory October 27/28, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Game Theory October 27/28, 2015 Chomp Chomp is a simple 2-player game. There is
More informationEleventh Annual Ohio Wesleyan University Programming Contest April 1, 2017 Rules: 1. There are six questions to be completed in four hours. 2.
Eleventh Annual Ohio Wesleyan University Programming Contest April 1, 217 Rules: 1. There are six questions to be completed in four hours. 2. All questions require you to read the test data from standard
More informationGrade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015 Chomp Chomp is a simple 2-player
More informationBoulder Chess. [0] Object of Game A. The Object of the Game is to fill the opposing Royal Chambers with Boulders. [1] The Board and the Pieces
Boulder Chess [0] Object of Game A. The Object of the Game is to fill the opposing Royal Chambers with Boulders [1] The Board and the Pieces A. The Board is 8 squares wide by 16 squares depth. It is divided
More informationMath Circles 9 / 10 Contest Preparation I
Math Circles 9 / 10 Contest Preparation I Centre for Education in Mathematics and Computing CEMC www.cemc.uwaterloo.ca February 4, 2015 Agenda 1 Warm-up Problem 2 Contest Information 3 Contest Format 4
More informationJohn Griffin Chess Club Rules and Etiquette
John Griffin Chess Club Rules and Etiquette 1. Chess sets must be kept together on the assigned table at all times, with pieces returned to starting position immediately following each game. 2. No communication
More informationTriple Challenge.txt
Triple Challenge 3 Complete Games in 1 Cartridge Chess Checkers Backgammon Playing Instructions For 1 or 2 Players TRIPLE CHALLENGE Triple Challenge.txt TRIPLE CHALLENGE is an exciting breakthrough in
More informationWhich Rectangular Chessboards Have a Bishop s Tour?
Which Rectangular Chessboards Have a Bishop s Tour? Gabriela R. Sanchis and Nicole Hundley Department of Mathematical Sciences Elizabethtown College Elizabethtown, PA 17022 November 27, 2004 1 Introduction
More informationChesServe Test Plan. ChesServe CS 451 Allan Caffee Charles Conroy Kyle Golrick Christopher Gore David Kerkeslager
ChesServe Test Plan ChesServe CS 451 Allan Caffee Charles Conroy Kyle Golrick Christopher Gore David Kerkeslager Date Reason For Change Version Thursday August 21 th Initial Version 1.0 Thursday August
More informationAn End Game in West Valley City, Utah (at the Harman Chess Club)
An End Game in West Valley City, Utah (at the Harman Chess Club) Can a chess book prepare a club player for an end game? It depends on both the book and the game Basic principles of the end game can be
More informationa 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 informationAnalyzing Games: Solutions
Writing Proofs Misha Lavrov Analyzing Games: olutions Western PA ARML Practice March 13, 2016 Here are some key ideas that show up in these problems. You may gain some understanding of them by reading
More informationLESSON 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 informationIts topic is Chess for four players. The board for the version I will be discussing first
1 Four-Player Chess The section of my site dealing with Chess is divided into several parts; the first two deal with the normal game of Chess itself; the first with the game as it is, and the second with
More informationarxiv: v2 [cs.ai] 15 Jul 2016
SIMPLIFIED BOARDGAMES JAKUB KOWALSKI, JAKUB SUTOWICZ, AND MAREK SZYKUŁA arxiv:1606.02645v2 [cs.ai] 15 Jul 2016 Abstract. We formalize Simplified Boardgames language, which describes a subclass of arbitrary
More informationCanadian Mathematics Competition An activity of The Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario
Canadian Mathematics Competition An activity of The Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario Canadian Computing Competition for the Awards Tuesday, March
More informationChess Puzzle Mate in N-Moves Solver with Branch and Bound Algorithm
Chess Puzzle Mate in N-Moves Solver with Branch and Bound Algorithm Ryan Ignatius Hadiwijaya / 13511070 Program Studi Teknik Informatika Sekolah Teknik Elektro dan Informatika Institut Teknologi Bandung,
More informationBAPC The Problem Set
BAPC 2012 The 2012 Benelux Algorithm Programming Contest The Problem Set A B C D E F G H I J Another Dice Game Black Out Chess Competition Digit Sum Encoded Message Fire Good Coalition Hot Dogs in Manhattan
More informationUTD Programming Contest for High School Students April 1st, 2017
UTD Programming Contest for High School Students April 1st, 2017 Time Allowed: three hours. Each team must use only one computer - one of UTD s in the main lab. Answer the questions in any order. Use only
More informationThis PDF document created by E.Baud / Eurasia-Chess is an extension to the «Mini-Shogi game formatted to fit a CD box, by Erhan Çubukcuoğlu», to print&cut yourself for crafting your own game. http://www.boardgamegeek.com/geeklist/51428/games-formatted-to-fit-in-a-cd-box
More informationCS61B, Fall 2014 Project #2: Jumping Cubes(version 3) P. N. Hilfinger
CSB, Fall 0 Project #: Jumping Cubes(version ) P. N. Hilfinger Due: Tuesday, 8 November 0 Background The KJumpingCube game is a simple two-person board game. It is a pure strategy game, involving no element
More informationChess Rules- The Ultimate Guide for Beginners
Chess Rules- The Ultimate Guide for Beginners By GM Igor Smirnov A PUBLICATION OF ABOUT THE AUTHOR Grandmaster Igor Smirnov Igor Smirnov is a chess Grandmaster, coach, and holder of a Master s degree in
More information2 Textual Input Language. 1.1 Notation. Project #2 2
CS61B, Fall 2015 Project #2: Lines of Action P. N. Hilfinger Due: Tuesday, 17 November 2015 at 2400 1 Background and Rules Lines of Action is a board game invented by Claude Soucie. It is played on a checkerboard
More informationEssential Chess Basics (Updated Version) provided by Chessolutions.com
Essential Chess Basics (Updated Version) provided by Chessolutions.com 1. Moving Pieces In a game of chess white has the first move and black moves second. Afterwards the players take turns moving. They
More informationUpper Primary Division Round 2. Time: 120 minutes
3 rd International Mathematics Assessments for Schools (2013-2014 ) Upper Primary Division Round 2 Time: 120 minutes Printed Name Code Score Instructions: Do not open the contest booklet until you are
More information3. Bishops b. The main objective of this lesson is to teach the rules of movement for the bishops.
page 3-1 3. Bishops b Objectives: 1. State and apply rules of movement for bishops 2. Use movement rules to count moves and captures 3. Solve problems using bishops The main objective of this lesson is
More informationFreshman Seminar 23j (Spring [2005 ]2006): Chess and Mathematics Preliminary Puzzle
Freshman Seminar 23j (Spring [2005 ]2006): Chess and Mathematics Preliminary Puzzle Here is a mathematical chess puzzle (see Section 3 below) that introduces some of the ideas, techniques, and questions
More information2009 ACM ICPC Southeast USA Regional Programming Contest. 7 November, 2009 PROBLEMS
2009 ACM ICPC Southeast USA Regional Programming Contest 7 November, 2009 PROBLEMS A: Block Game... 1 B: Euclid... 3 C: Museum Guards... 5 D: Knitting... 7 E: Minesweeper... 9 F: The Ninja Way... 10 G:
More informationInfinite chess. Josh Brunner. May 18, 2018
Infinite chess Josh Brunner May 18, 2018 1 Abstract We present a summary of known results about infinite chess, and propose a concrete idea for how to extend the largest known game value for infinite chess
More informationThe Pieces Lesson. In your chess set there are six different types of piece.
In your chess set there are six different types of piece. In this lesson you'll learn their names and where they go at the start of the game. If you happen to have a chess set there it will help you to
More informationA Simple Pawn End Game
A Simple Pawn End Game This shows how to promote a knight-pawn when the defending king is in the corner near the queening square The introduction is for beginners; the rest may be useful to intermediate
More informationWould You Like To Earn $1000 s With The Click Of A Button?
Would You Like To Earn $1000 s With The Click Of A Button? (Follow these easy step by step instructions and you will) This e-book is for the USA and AU (it works in many other countries as well) To get
More informationProblem A. Ancient Keyboard
3th ACM International Collegiate Programming Contest, 5 6 Asia Region, Tehran Site Sharif University of Technology 1 Dec. 5 Sponsored by Problem A. Ancient Keyboard file: Program file: A.IN A.cpp/A.c/A.dpr/A.java
More informationHere is Part Seven of your 11 part course "Openings and End Game Strategies."
Here is Part Seven of your 11 part email course "Openings and End Game Strategies." =============================================== THE END-GAME As I discussed in the last lesson, the middle game must
More informationProblem A. First Mission
Problem A. First Mission file: Herman is a young Padawan training to become a Jedi master. His first mission is to understand the powers of the force - he must use the force to print the string May the
More information2006 Canadian Computing Competition: Junior Division. Sponsor:
2006 Canadian Computing Competition: Junior Division Sponsor: Canadian Computing Competition Student Instructions for the Junior Problems 1. You may only compete in one competition. If you wish to write
More informationAdversary Search. Ref: Chapter 5
Adversary Search Ref: Chapter 5 1 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans is possible. Many games can be modeled very easily, although
More informationUKPA Presents. March 12 13, 2011 INSTRUCTION BOOKLET.
UKPA Presents March 12 13, 2011 INSTRUCTION BOOKLET This contest deals with Sudoku and its variants. The Puzzle types are: No. Puzzle Points 1 ChessDoku 20 2 PanDigital Difference 25 3 Sequence Sudoku
More informationIntroduction 5 Algebraic Notation 6 What s So Special About the Endgame? 8
Contents PAWN RACE Introduction 5 Algebraic Notation 6 What s So Special About the Endgame? 8 Basic Mates 1) Mate with the Queen 12 2) Mate with Two Rooks 14 3) Mate with the Rook: Method 1 16 4) Mate
More informationPresentation by Toy Designers: Max Ashley
A new game for your toy company Presentation by Toy Designers: Shawntee Max Ashley As game designers, we believe that the new game for your company should: Be equally likely, giving each player an equal
More informationIf a word starts with a vowel, add yay on to the end of the word, e.g. engineering becomes engineeringyay
ENGR 102-213 - Socolofsky Engineering Lab I - Computation Lab Assignment #07b Working with Array-Like Data Date : due 10/15/2018 at 12:40 p.m. Return your solution (one per group) as outlined in the activities
More informationSponsored by IBM. 6. The input to all problems will consist of multiple test cases unless otherwise noted.
ACM International Collegiate Programming Contest 2009 East Central Regional Contest McMaster University University of Cincinnati University of Michigan Ann Arbor Youngstown State University October 31,
More informationChess, a mathematical definition
Chess, a mathematical definition Jeroen Warmerdam, j.h.a.warmerdam@planet.nl August 2011, Voorschoten, The Netherlands, Introduction We present a mathematical definition for the game of chess, based on
More informationCHESS SOLUTION PREP GUIDE.
CHESS SOLUTION PREP GUIDE. Article 1 1minute 46 seconds 5minutes. 1. Can a player capture the opponents king?---------------------------------------------------[1] 2. When does a player have the move?
More informationState Math Contest (Junior)
Name: Student ID: State Math Contest (Junior) Instructions: Do not turn this page until your proctor tells you. Enter your name, grade, and school information following the instructions given by your proctor.
More informationWould You Like To Earn $1000 s With The Click Of A Button?
Would You Like To Earn $1000 s With The Click Of A Button? (Follow these easy step by step instructions and you will) This e-book is for the USA and AU (it works in many other countries as well) To get
More informationChess for Kids and Parents
Chess for Kids and Parents From the start till the first tournament Heinz Brunthaler 2006 Quality Chess Contents What you need (to know) 1 Dear parents! (Introduction) 2 When should you begin? 2 The positive
More informationProject 1: A Game of Greed
Project 1: A Game of Greed In this project you will make a program that plays a dice game called Greed. You start only with a program that allows two players to play it against each other. You will build
More informationAdvanced Strategy in Spades
Advanced Strategy in Spades Just recently someone at elite and a newbie to spade had asked me if there were any guidelines I follow when bidding, playing if there were any specific strategies involved
More informationProblem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.)
Problem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.) Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More informationStat 155: solutions to midterm exam
Stat 155: solutions to midterm exam Michael Lugo October 21, 2010 1. We have a board consisting of infinitely many squares labeled 0, 1, 2, 3,... from left to right. Finitely many counters are placed on
More informationNovice Nook. When You're Winning, It's a Whole Different Game. Dan Heisman
When You're Winning, It's a Whole Different Game Dan s saying of the month: When you lose your fear of a rating, you can become that rating. Novice Nook Dan Heisman One of the most common problems beginning
More informationSeparation Numbers of Chessboard Graphs. Doug Chatham Morehead State University September 29, 2006
Separation Numbers of Chessboard Graphs Doug Chatham Morehead State University September 29, 2006 Acknowledgments Joint work with Doyle, Fricke, Reitmann, Skaggs, and Wolff Research partially supported
More informationChess and Python revisited
Chess and Python revisited slide 1 there exists a PyGame project http://www.pygame.org/ project-chessboard-282-.html which draws a chess board and allows users to make FIDE legal moves (by clicking on
More informationGROUP ROUND INSTRUCTIONS
GROUP ROUND INSTRUCTIONS Your team will have 40 minutes to answer 10 questions. Each team will have the same questions. Each question is worth 6 points. However, some questions are easier than others!
More informationCayley Contest (Grade 10) Thursday, February 25, 2010
Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario Cayley Contest (Grade 10) Thursday, February 2, 2010 Time:
More information12 Special Moves - Stalemate, Pawn Promotion, Castling, En Passant capture
12 Special Moves - Stalemate, Pawn Promotion, Castling, En Passant capture Stalemate is one of the strangest things in chess. It nearly always confuses beginners, but it has a confusing history. A definition:
More informationSuggested by Joshua L. Mask. Written by Ken Mask, MD. Illustrated by Simmie Williams
Suggested by Joshua L. Mask Written by Ken Mask, MD Illustrated by Simmie Williams This is a very important book for kids from an impressively creative young thinker. Wynton Marsalis Suggested by: Joshua
More informationEssentials. Week by. Week
Week by Week MATHEMATICS Essentials Grade WEEK 2 = 9 Fun with Multiplication If you had six of each of these polygons, how many angles would you have? Seeing Math Describe your observations about the number
More informationGoogle DeepMind s AlphaGo vs. world Go champion Lee Sedol
Google DeepMind s AlphaGo vs. world Go champion Lee Sedol Review of Nature paper: Mastering the game of Go with Deep Neural Networks & Tree Search Tapani Raiko Thanks to Antti Tarvainen for some slides
More informationLecture 6: Latin Squares and the n-queens Problem
Latin Squares Instructor: Padraic Bartlett Lecture 6: Latin Squares and the n-queens Problem Week 3 Mathcamp 01 In our last lecture, we introduced the idea of a diagonal Latin square to help us study magic
More informationCrossing Game Strategies
Crossing Game Strategies Chloe Avery, Xiaoyu Qiao, Talon Stark, Jerry Luo March 5, 2015 1 Strategies for Specific Knots The following are a couple of crossing game boards for which we have found which
More informationLecture 2: Sum rule, partition method, difference method, bijection method, product rules
Lecture 2: Sum rule, partition method, difference method, bijection method, product rules References: Relevant parts of chapter 15 of the Math for CS book. Discrete Structures II (Summer 2018) Rutgers
More informationPascal Contest (Grade 9)
Canadian Mathematics Competition An activity of The Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario Pascal Contest (Grade 9) Wednesday, February 0, 00 C.M.C.
More informationLEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together?
LEVEL I 1. Three numbers are chosen from 1,, 3..., n. In how many ways can the numbers be chosen such that either maximum of these numbers is s or minimum of these numbers is r (r < s)?. Six candidates
More informationProblem F. Chessboard Coloring
Problem F Chessboard Coloring You have a chessboard with N rows and N columns. You want to color each of the cells with exactly N colors (colors are numbered from 0 to N 1). A coloring is valid if and
More informationN-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 informationFigure 1: The Game of Fifteen
1 FIFTEEN One player has five pennies, the other five dimes. Players alternately cover a number from 1 to 9. You win by covering three numbers somewhere whose sum is 15 (see Figure 1). 1 2 3 4 5 7 8 9
More informationFinal Project: Reversi
Final Project: Reversi Reversi is a classic 2-player game played on an 8 by 8 grid of squares. Players take turns placing pieces of their color on the board so that they sandwich and change the color of
More informationSTATION 1: ROULETTE. Name of Guesser Tally of Wins Tally of Losses # of Wins #1 #2
Casino Lab 2017 -- ICM The House Always Wins! Casinos rely on the laws of probability and expected values of random variables to guarantee them profits on a daily basis. Some individuals will walk away
More informationLower Fall Programming Contest 2017
Lower Fall Programming Contest 2017 Lower Division Oct. 28th 2017 Do not open until contest starts Instructions for Participants Contest URL: https://bastion.cs.fsu.edu You have 5 hours to answer questions.
More information