DOCSLIB.ORG

6Upcards.Pdf

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
6Upcards.Pdf A Deck of Cards • A deck consists of 52 cards Algorithms for Cards • A card has a – Suit: spades, clubs, hearts, or diamonds – Value: 2, 3, 4, ..., 10, Jack, Queen, King, or Ace ♠ ♣ ♦ ♥ • The algorithms we discuss can be made to work with any number of cards Algorithms Come First Some Card Concerns • We'll look at some common card • We'll consider three things manipulations and then simulate them – How can we sort cards in order from • This will help us design classes for smallest to largest (or from largest to representing cards smallest)? – How can you cut a deck of cards? • Rule of thumb: first work out your – How can you shuffle a deck of cards? algorithms by hand, and then use your understanding of them to design good • Each of these questions lead to programs interesting computer science questions Sorting Your Hand Sorting: Method 1 • Deal 7 cards 4♣ T♠ Q♦ 4♥ 9♦ J♦ A♦ • Put the smallest – Ignore suits (for card in your hand 4♣ T♠ Q♦ 4♥ 9♦ J♦ A♦ now!) face-up on the table – Aces are high • Repeat this until all • Put them into sorted your cards are on order, lowest to 4♣ 4♥ 9♦ T♠ J♦ Q♦ A♦ the table ♣ ♥ ♦ ♠ ♦ ♦ ♦ highest, left to right or • Pick up your cards, 4 4 9 T J Q A • Try it! How do you 4♥ 4♣ 9♦ T♠ J♦ Q♦ A♦ they're now sorted! do it? Sorting: Method 2 Two Sorting Methods • Divide your hand into • Method 1 is called selection sort ♣ ♠ ♦ ♥ ♦ ♦ ♦ a sorted and 4 T Q 4 9 J A • Method 2 is called insertion sort unsorted part • Put the smallest card • Both of these algorithms are good for from the unsorted sorting small numbers of objects part onto the end of – If you're sorting thousands or millions of the sorted part 4♣ 4♥ 9♦ T♠ J♦ Q♦ A♦ things, these methods are too slow • Repeat until all your – There are faster ways to sort: quicksort, cards are sorted mergesort, heapsort, etc. Selection Sort in Detail Sorting with Suits • Use two piles, one called sorted, the • When two cards have the same value, other called unsorted we can order them if we specify an • Initially, everything is in unsorted order for the suits • Pick the smallest card from unsorted, • There are 24 different ways to order the and put it face up on top of sorted suits • Repeat the previous step until • Pick one, such as ♠ < ♥ < ♦ < ♣ like unsorted is empty --- then everything – This means: 7♠ < 7♥ < 7♦ < 7♣ is in sorted order in sorted! Cutting Cards by Hand Cutting Cards • Not many people can pick up exactly 26 • The standard cut cards from a deck all the time! – Put the deck on the table – Although it can be done, with practice! – Pick up the top half of the deck and place it • After a standard cut, the previous top to the right and bottom cards are now together in – Pick up the bottom half and put it on top of the middle of the pack the other half – Cheaters & magicians can exploit this fact! • This is easy to do by hand, but tricky to • There are fancier cuts, e.g. divide the do efficiently with a computer! deck into 3 parts, and rearrange them What Does Cutting Do? What Does Cutting Do? 1 2 3 4 5 6 7 8 9 10 11 12 13 • Think for a moment how cards are 2♥ 3♥ 4♥ 5♥ 6♥ 7♥ 8♥ 9♥ T♥ J♥ Q♥ K♥ A♥ rearranged in a standard cut • How does the deck change? • Let's look at a simplified example using only the hearts 2♥ 3♥ 4♥ 5♥ 6♥ 7♥ 8♥ 9♥ T♥ J♥ Q♥ K♥ A♥ 7♥ 8♥ 9♥ T♥ J♥ Q♥ K♥ A♥ 2♥ 3♥ 4♥ 5♥ 6♥ 1 2 3 4 5 6 7 8 9 10 11 12 13 A Neat Connection Weird Cuts: A Slow Cut • Cutting a deck of cards is the same as Put the bottom card of the deck on the top doing cut and paste in a word Repeat the previous action 26 or so times processor! • People can't do this very quickly, but – Replace cards with letters computers can – Imagine highlighting the left part – Computers don't move physical cards, only – Then "drag" it to the end of the right part representations of them Weird Cuts: Another Slow Cut Weird Cuts: A Flip Cut From the top of the deck, deal 26 or so cards – Hold the deck in your right hand face-up onto the table – Pick up the top half in your left hand Turn over the pile on the table – Turn the pile in your left hand upside down Place the pile on the table on top of the pile – Turn the pile in your right hand upside in your hand down • Admittedly, these two cuts won't – Put the pile in your left on the pile in your impress your poker buddies (unless right they are CS students!) – Turn the deck upside down (so it's now right-side up) Different Views of the Same Shuffling Cards Thing • There are many ways to shuffle cards • Cutting a deck of cards is the same as – Milk shuffle: repeatedly remove the top and – Doing cut and paste in a word processor bottom cards – Rotating a sequence in a circular fashion – Riffle shuffle: cut the deck into two piles, • This is what the slow cuts did directly and interleave the cards – Swapping unequal segments of a • A perfect riffle shuffle is when you cut the deck sequence into two piles of 26, and perfectly alternate cards from each pile • This is what the flip cut did directly • Also known as a faro shuffle, or a weave shuffle Shuffling Cards Random Shuffle • We will consider two sorts of shuffles: • We want to put the deck into a –A random shuffle, where the deck is completely random order randomly permuted – We want to randomly permute the deck – The standard riffle shuffle, where the • This means that each card has the deck is cut into two approximately equal same chance of being in any position halves, and the deck is re-formed by alternately adding cards from each half • Ideally, we want to do this quickly, and without using extra memory 52 Pick Up Faro Shuffles • Here's one way to generate a random • To do a faro shuffle permutation by hand: – Make two piles of exactly 26 cards each – Throw the deck in the air so the cards fly – Alternate choosing a card from each pile, everywhere placing the selected card on a new pile – Then pick them up, in no particular order – If the top card remains the top card, it's • Card players don't usually shuffle cards called an out shuffle; otherwise it's an in this way, but computers often do shuffle • 8 out shuffles in a row returns a deck to it's original order! Imperfect Riffle Shuffles Which Shuffle to Choose? – Make two piles of roughly 26 cards each • If you are writing a card game, you – Alternate choosing clumps of, say, 0 to 3 probably want randomness cards from each pile, placing the clump on – Perfect riffle shuffles don't mix up the cards the new pile very well • We can program a computer to do • Thus, either a random permutation or either perfect or imperfect riffle shuffles an imperfect riffle shuffle will do • How can you create a random permutation of cards? Random Permutations: Random Permutations: Method 1 Method 2 • This simple method works very well: – Hold the deck in your hand For i = 1 to 52 do – Select a random card and place it face Choose R to be a random number from 1 to 52 down on a pile on the table Swap card i with card R – Repeat the previous step until you no End for longer hold any cards in your hand • It's fast, doesn't use extra memory, and • This is simple, but it requires twice as is easy to understand and program much memory as the previous method – Hard to do by hand, though! – That's okay for only 52 cards Pseudocode for Method 2 Pseudocode for Method 2 • Call the pile of cards in your hand unprocessed contains all the cards unprocessed processed is empty • Call the pile of cards on the table While not unprocessed.empty() do processed Remove a randomly chosen card C from • Initially, all the cards are in unprocessed unprocessed, and processed is Put C on top of processed empty End while Representing a Permutation Permutations of ints • Our goal: generate random • This puts 1 to 52 into a vector: permutations of cards vector<int> p; // processed • But let's look at the bare essentials first Vector<int> u; // unprocessed • Let's work with a vector<int> instead for(int i=1; i<=52; ++i) of cards u.push_back(i); – Imagine writing the numbers 1 to 52 on • We can swap u[i] with u[j] using your cards swap(u[i],u[j]) • Later, you can use a Card class Method 2 in C++ Method 2 Modified •The vectors u and p have just been • We can rewrite this method to so it only correctly initialized, so here's the loop: uses one vector while (u.size() != 0) { • The trick is to notice that the number of int r = 1 + (rand() % 52); cards in processed and p.push_back(u[r]); unprocessed is always 52 swap(u[r],u[u.size() - 1]); u.pop_back(); // remove u's last • We can partition one 52-element vector // element into two parts, one for processed, the } // while other for unprocessed The following slides Red numbers are show how to randomly selected randomly permute a vector ..
Load more

Recommended publications
  • Shuffling the Deck” in CFG Terms by Luci Englert Mckean, NSRF Assistant Director and National Facilitator
    6 NSRF® Connections • April 2018 What are the best combinations for CFG teams and in CFG trainings? “Shuffling the Deck” in CFG terms By Luci Englert McKean, NSRF Assistant Director and National Facilitator. [email protected] Imagine your school staff repre- number, various classrooms: several all the time. In contrast, coming to a sented by a stack of playing cards. middle school math teachers of rela- CFG coaches’ training, especially an There are a variety of metaphors you tively equal power working together “open” training with educators of all might choose here, but for instance, on shared curricula, for example. sorts, is the perfect opportunity to let’s have the number cards represent Since most of us are familiar with get vastly different perspectives on grade levels, the suits (hearts, spades, this sort of working group, I have a one’s problems that pushes each one’s clubs, diamonds) represent subject question for you. How many times thinking beyond the silo of their usual matter, and the face cards (king, have you sat in a committee meeting interactions. queen, jack) represent administrators. and, when a problem is introduced, For the sake of discussion, let’s You might even identify a “joker” or you have a pretty good idea of who will stay temporarily with our imaginary two. Depending on the context of the speak first, who may not speak at all, cohort of 15 literacy coaches from the “game,” you might even find a few and approximately what every speaker same district. In that training, when “wild cards” among your colleagues.
    [Show full text]
  • Flexible Games by Which I Mean Digital Game Systems That Can Accommodate Rule-Changing and Rule-Bending
    Let’s Play Our Way: Designing Flexibility into Card Game Systems Gifford Cheung A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Washington 2013 Reading Committee: David Hendry, Chair David McDonald Nicolas Ducheneaut Jennifer Turns Program Authorized to Offer Degree: Information School ©Copyright 2013 Gifford Cheung 2 University of Washington Abstract Let’s Play Our Way: Designing Flexibility into Card Game Systems Gifford Cheung Chair of the Supervisory Committee: Associate Professor David Hendry Information School In this dissertation, I explore the idea of designing “flexible game systems”. A flexible game system allows players (not software designers) to decide on what rules to enforce, who enforces them, and when. I explore this in the context of digital card games and introduce two design strategies for promoting flexibility. The first strategy is “robustness”. When players want to change the rules of a game, a robust system is able to resist extreme breakdowns that the new rule would provoke. The second is “versatility”. A versatile system can accommodate multiple use-scenarios and can support them very well. To investigate these concepts, first, I engage in reflective design inquiry through the design and implementation of Card Board, a highly flexible digital card game system. Second, via a user study of Card Board, I analyze how players negotiate the rules of play, take ownership of the game experience, and communicate in the course of play. Through a thematic and grounded qualitative analysis, I derive rich descriptions of negotiation, play, and communication. I offer contributions that include criteria for flexibility with sub-principles of robustness and versatility, design recommendations for flexible systems, 3 novel dimensions of design for gameplay and communications, and rich description of game play and rule-negotiation over flexible systems.
    [Show full text]
  • Examining Different Strategies for the Card Game Sueca
    Universiteit Leiden Opleiding Informatica & Economie Examining different strategies for the card game Sueca Name: Vanessa Lopes Carreiro Date: July 13, 2016 1st supervisor: Walter Kosters 2nd supervisor: Rudy van Vliet BACHELOR THESIS Leiden Institute of Advanced Computer Science (LIACS) Leiden University Niels Bohrweg 1 2333 CA Leiden The Netherlands Examining different strategies for the card game Sueca Vanessa Lopes Carreiro Abstract Sueca is a point-trick card game with trumps popular in Portugal, Brazil and Angola. There has not been done any research into Sueca. In this thesis we will study the card game into detail and examine different playing strategies, one of them being basic Monte-Carlo Tree Search. The purpose is to see what strategies can be used to play the card game best. It turns out that the basic Monte-Carlo strategy plays best when both team members play that strategy. i ii Acknowledgements I would like to thank my supervisor Walter Kosters for brainstorming with me about the research and support but also for the conversations about life. It was a pleasure working with him. I am also grateful for Rudy van Vliet for being my second reader and taking time to read this thesis and providing feedback. iii iv Contents Abstract i Acknowledgements iii 1 Introduction 1 2 The game 2 2.1 The deck and players . 2 2.2 The deal . 3 2.3 Theplay ................................................... 3 2.4 Scoring . 4 3 Similar card games 5 3.1 Klaverjas . 5 3.2 Bridge . 6 4 How to win Sueca 7 4.1 Leading the first trick .
    [Show full text]
  • Kirby What If Culture Was Nature
    What if Culture was Nature all Along? 55242_Kirby.indd242_Kirby.indd i 222/12/162/12/16 44:59:59 PPMM New Materialisms Series editors: Iris van der Tuin and Rosi Braidotti New Materialisms asks how materiality permits representation, actualises ethi- cal subjectivities and innovates the political. The series will provide a discursive hub and an institutional home to this vibrant emerging fi eld and open it up to a wider readership. Editorial Advisory board Marie-Luise Angerer, Karen Barad, Corinna Bath, Barbara Bolt, Felicity Colman, Manuel DeLanda, Richard Grusin, Vicki Kirby, Gregg Lambert, Nina Lykke, Brian Massumi, Henk Oosterling, Arun Saldanha Books available What if Culture was Nature all Along? Edited by Vicki Kirby Critical and Clinical Cartographies: Architecture, Robotics, Medicine, Philosophy Edited by Andrej Radman and Heidi Sohn Books forthcoming Architectural Materialisms: Non-Human Creativity Edited by Maria Voyatzaki 55242_Kirby.indd242_Kirby.indd iiii 222/12/162/12/16 44:59:59 PPMM What if Culture was Nature all Along? Edited by Vicki Kirby 55242_Kirby.indd242_Kirby.indd iiiiii 222/12/162/12/16 44:59:59 PPMM Edinburgh University Press is one of the leading university presses in the UK. We publish academic books and journals in our selected subject areas across the humanities and social sciences, combining cutting-edge scholarship with high editorial and production values to produce academic works of lasting importance. For more information visit our website: edinburghuniversitypress.com © editorial matter and organisation
    [Show full text]
  • A Fast Mental Poker Protocol
    J. Math. Cryptol. 6 (2012), 39–68 DOI 10.1515/jmc-2012-0004 © de Gruyter 2012 A fast mental poker protocol Tzer-jen Wei and Lih-Chung Wang Communicated by Kwangjo Kim Abstract. In this paper, we present a fast and secure mental poker protocol. The basic structure is the same as Barnett & Smart’s and Castellà-Roca’s protocols but our encryp- tion scheme is different. With this alternative encryption scheme, our shuffle is not only twice as fast, but it also has different security properties. As such, Barnett & Smart’s and Castellà-Roca’s security proof cannot be applied to our protocol directly. Nevertheless, our protocol is still provably secure under the DDH assumption. The only weak point of our protocol is that reshuffling a small subset of cards might take longer than Barnett & Smart’s and Castellà-Roca’s protocols. Therefore, our protocol is more suitable for card games such as bridge, most poker games, mahjong, hearts, or black jack, which do not require much partial reshuffling. Keywords. Mental poker, DDH assumption. 2010 Mathematics Subject Classification. 94A60, 68M12. 1 Introduction 1.1 Mental poker Mental poker is the study of protocols that allow players to play fair poker games over the net without a trusted third party. There are very few assumptions about the behavior of adversaries in mental poker. Adversaries are typically allowed to have a coalition of any size and can conduct active attacks. The main challenge is to design a secure mental poker protocol that is fast enough for practical needs. Numerous mental poker protocols have been proposed ([4,5,10–12,17,18,20,25,26,28,30,34–36]) and many of them are provably secure, but all commercial online poker rooms are still based on client-server architec- tures.
    [Show full text]
  • The Penguin Book of Card Games
    PENGUIN BOOKS The Penguin Book of Card Games A former language-teacher and technical journalist, David Parlett began freelancing in 1975 as a games inventor and author of books on games, a field in which he has built up an impressive international reputation. He is an accredited consultant on gaming terminology to the Oxford English Dictionary and regularly advises on the staging of card games in films and television productions. His many books include The Oxford History of Board Games, The Oxford History of Card Games, The Penguin Book of Word Games, The Penguin Book of Card Games and the The Penguin Book of Patience. His board game Hare and Tortoise has been in print since 1974, was the first ever winner of the prestigious German Game of the Year Award in 1979, and has recently appeared in a new edition. His website at http://www.davpar.com is a rich source of information about games and other interests. David Parlett is a native of south London, where he still resides with his wife Barbara. The Penguin Book of Card Games David Parlett PENGUIN BOOKS PENGUIN BOOKS Published by the Penguin Group Penguin Books Ltd, 80 Strand, London WC2R 0RL, England Penguin Group (USA) Inc., 375 Hudson Street, New York, New York 10014, USA Penguin Group (Canada), 90 Eglinton Avenue East, Suite 700, Toronto, Ontario, Canada M4P 2Y3 (a division of Pearson Penguin Canada Inc.) Penguin Ireland, 25 St Stephen’s Green, Dublin 2, Ireland (a division of Penguin Books Ltd) Penguin Group (Australia) Ltd, 250 Camberwell Road, Camberwell, Victoria 3124, Australia
    [Show full text]
  • Coherent Electron Transport in Triple Quantum Dots
    Coherent Electron Transport in Triple Quantum Dots Adam Schneider Centre for the Physics of Materials Department of Physics McGill University Montreal. Quebec Canada A Thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Master of Science © Adam Schneider. 2008 Library and Archives Bibliotheque et 1*1 Canada Archives Canada Published Heritage Direction du Branch Patrimoine de ['edition 395 Wellington Street 395, rue Wellington OttawaONK1A0N4 Ottawa ON K1A 0N4 Canada Canada Your file Votre reference ISBN: 978-0-494-53766-4 Our file Notre reference ISBN: 978-0-494-53766-4 NOTICE: AVIS: The author has granted a non­ L'auteur a accorde une licence non exclusive exclusive license allowing Library and permettant a la Bibliotheque et Archives Archives Canada to reproduce, Canada de reproduire, publier, archiver, publish, archive, preserve, conserve, sauvegarder, conserver, transmettre au public communicate to the public by par telecommunication ou par I'lnternet, prefer, telecommunication or on the Internet, distribuer et vendre des theses partout dans le loan, distribute and sell theses monde, a des fins commerciales ou autres, sur worldwide, for commercial or non­ support microforme, papier, electronique et/ou commercial purposes, in microform, autres formats. paper, electronic and/or any other formats. The author retains copyright L'auteur conserve la propriete du droit d'auteur ownership and moral rights in this et des droits moraux qui protege cette these. Ni thesis. Neither the thesis nor la these ni des extraits substantiels de celle-ci substantial extracts from it may be ne doivent etre imprimes ou autrement printed or otherwise reproduced reproduits sans son autorisation.
    [Show full text]
  • Who Would Have Thought Card Shuffling Was So Involved?
    Who would have thought card shuffling was so involved? Leah Cousins August 26, 2019 Abstract In this paper we present some interesting mathematical results on card shuffling for two types of shuffling: the famous riffle shuffle and the random-to-top shuffle. A natural question is how long it takes for a deck to be randomized under a particular shuffling technique. Mathematically, this is the mixing time of a Markov chain. In this paper we present these results for both the riffle shuffle and the random-to-top shuffle. For the same two shuffles, we also include natural results for card shuffling which directly relate to well-known combinatorial objects such as Bell numbers and Young tableaux. Contents 1 Introduction 2 2 What is Card Shuffling, Really? 3 2.1 Shuffles are Bijective Functions . .3 2.2 Random Walks and Markov Chains . .4 2.3 What is Randomness? . .5 2.4 There are even shuffle algebras ?.........................6 3 The Riffle Shuffle 7 3.1 The Mixing Time . .8 3.2 Riffle Shuffling for Different Card Games . 11 3.3 Carries and Card Shuffles . 14 4 The Random-to-top Shuffle 17 4.1 Lifting Cards . 17 4.2 Properties of the Lifting Process . 18 4.3 Bell Numbers and the Random-to-top Shuffle . 18 4.4 Young Diagrams . 22 4.5 The Mixing Time . 29 5 Concluding Remarks 36 1 1 Introduction Humans have been shuffling decks of cards since playing cards were first invented in 1000AD in Eastern Asia [25]. It is unclear when exactly card shuffling theory was first studied, but since card shuffling theory began with magicians' card tricks, it is fair to think that it was around the time that magicians were studying card tricks.
    [Show full text]
  • TOPICS to BE COVERED in THIS CHAPTER: • the Market As A
    1 1 UNDERSTANDING INTERACTIONS THROUGH CROSS- CORRELATIONS S. Sinha TOPICS TO BE COVERED IN THIS CHAPTER: The market as a complex interacting systen open to exter- • nal influece Correlation between N infinite- and finite length random • walks Wigner matrices versus Wishart matrices • Bio-box on Wigner and Wishart • Eigenvalues and eigenvectors of random matrices • Semi-circle and Sengupta-Mitra distributions for eigen- • values Spacings of eigenvalues: Clue to the random nature of the • walks “Unfolding" the eigenvalues • Contributions of HE Stanley, JP Bouchaud et al • Connecting interactions to correlations by factor models • Building networks of interactions: Minimal spanning tree, • filtering the correlation matrix etc. Contributions of RN Mantegna, J Kertesz, JP Onnela, A Chakraborti, • K Kaski et al Econophysics. Sinha, Chatterjee, Chakraborti and Chakrabarti Copyright c 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim ISBN: 3-527-XXXXX-X 2 1 UNDERSTANDING INTERACTIONS THROUGH CROSS-CORRELATIONS Utility in Finance: Capital Asset Pricing Model and Markowitz • Portfolio optimization “Because nothing is completely certain but subject to fluctuations, it is dangerous for people to allocate their capital to a single or a small number of securities. [. ] No one has reason to expect that all securities . will cease to pay off at the same time, and the entire capital be lost.” – from the 1776 prospectus of an early mutual fund in the Netherlands [1] As the above quote makes it evident, those interested in the study of fi- nancial market movements have long been concerned with the correlation be- tween price movements of different commodities or stocks. Recently, with the emergence of the understanding that markets are examples of complex sys- tems with many interacting components, cross-correlations have been useful for inferring the existence of collective modes in the underlying dynamics of financial markets.
    [Show full text]
  • American Expatriate Writers and the Process of Cosmopolitanism a Dissert
    UNIVERSITY OF CALIFORNIA, SAN DIEGO Beyond the Nation: American Expatriate Writers and the Process of Cosmopolitanism A Dissertation submitted in partial satisfaction of the Requirements for the degree Doctor of Philosophy in Literature by Alexa Weik Committee in charge: Professor Michael Davidson, Chair Professor Frank Biess Professor Marcel Hénaff Professor Lisa Lowe Professor Don Wayne 2008 © Alexa Weik, 2008 All rights reserved The Dissertation of Alexa Weik is approved, and it is acceptable in quality and form for publication on microfilm: _____________________________________ _____________________________________ _____________________________________ _____________________________________ _____________________________________ Chair University of California, San Diego 2008 iii To my mother Barbara, for her everlasting love and support. iv “Life has suddenly changed. The confines of a community are no longer a single town, or even a single nation. The community has suddenly become the whole world, and world problems impinge upon the humblest of us.” – Pearl S. Buck v TABLE OF CONTENTS Signature Page……………………………………………………………… iii Dedication………………………………………………………………….. iv Epigraph……………………………………………………………………. v Table of Contents…………………………………………………………… vi Acknowledgements…………………………………………………………. vii Vita………………………………………………………………………….. xi Abstract……………………………………………………………………… xii Introduction………………………………………………………………….. 1 Chapter 1: A Brief History of Cosmopolitanism…………...………………... 16 Chapter 2: Cosmopolitanism in Process……..……………… …………….... 33
    [Show full text]
  • Columbia Chronicle College Publications
    Columbia College Chicago Digital Commons @ Columbia College Chicago Columbia Chronicle College Publications 4-22-2002 Columbia Chronicle (04/22/2002 - Supplement) Columbia College Chicago Follow this and additional works at: http://digitalcommons.colum.edu/cadc_chronicle Part of the Journalism Studies Commons This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License. Recommended Citation Columbia College Chicago, "Columbia Chronicle (04/22/2002 - Supplement)" (April 22, 2002). Columbia Chronicle, College Publications, College Archives & Special Collections, Columbia College Chicago. http://digitalcommons.colum.edu/ cadc_chronicle/530 This Book is brought to you for free and open access by the College Publications at Digital Commons @ Columbia College Chicago. It has been accepted for inclusion in Columbia Chronicle by an authorized administrator of Digital Commons @ Columbia College Chicago. ]illian }{elmer &Xatie Walsh > Special Section Editors RECEIVED APR II 2002 COLUMBIA OOt.LBGE LIBRARY • \·. .. I . • ._ _. .• ·~' • • • , ' .. 2 They Call Me Coo-Coo The Shotput Thrower by Chandra "Goldie" Brown by Brian Costello I lJa,~ls~~iff and later became two people with two ·:Not to<i'dijiny people know this, but when you make the United very different nifhle\.- --sl> ~~ ce myself to you. My name i~· Chandra State~ Olytj{pics team, you have to take a few classes in grooming, and my other name I'll tell you a . .. n1anrit:rs, aijd cultural sensitivity training. If you're surprised by . One weekea4,.~~~Qt ~visit my father. On that weekend my co.usin's brother­ this, irpagifie how I must have felt; I just figured, since I made it ~n-~aw molesterline.!· JsY~fe.d to scream when I woke up and felt his fingers onto the._shOtput ~earn ~d all, all I'd have to do is throw a shotput ms1de of m~ .
    [Show full text]
  • Who's for Euchre? by SCOTT CORBETT Some of the Old Card Games Woxdd Baj^E Today ^S Players,, Including Canasta Fanatics
    51 Who's for Euchre? By SCOTT CORBETT Some of the old card games woxdd baj^e today ^s players,, including canasta fanatics T'S been years since I've played any card and cards dealt in batches of two or three fall with Pebbley, Wyo. games except bridge, poker, samba (a form of a plop. First you get poor shuffling because of Sir: I canasta), canasta (a form of stupidity) and too few cards, and then instead of a nice one-card- Just because a smartalec like you does not know Zioncheck. In looking through a book of card at-a-time deal as in bridge you get plop plop, plop anybody who plays euchre does not mean that games, I find that in my time I have played 14 dif­ plop. That's in two-handed euchre, of course. In thousands of intelligent Americans are not playing ferent games, the others being gin rummy with my three-handed euchre you get plop plop plop, plop it and enjoying it every day of their life. Only last' wife, cribbage with a roommate, seven-up with plop plop. week the Pebbley Auction Euchre Club of this three grade-school playmates, Michigan with The only hope I see for euchre is in auction city conducted a Large for which all tickets were neighbors, Russian bank with my mother-in-law, euchre for eight people, which calls for a 60-card sold out well in advance, prizes were donated by montebank, blackjack and faro with two elderly pack with 11 and 12 spots included.
    [Show full text]