PROGRAMMING PROJECTS ON CHESS Erkki M~ikinen University of Tampere, Department of Computer Science P.O. Box 607, FIN-33101 Tampere, Finland e-mail: em@cs.uta.fi 1. Introduction Most computer science students know the rules of chess. Many of them are interested in the game at least on the level that they play on occasion. We can take advantage of this interest by organizing projects on chess related topics. Most introductory text books in programming and data structures contain the knight's tour and eight queens problems. The purpose of this paper is to suggest chess related topics which are far more versatile and also more difficult. However, we neglect the most obvious such topic, chess-playing programs. Instead, we introduce some programming projects organized at the University of Tampere. The projects to be introduced in chapters 2-4 have been one semester projects (5 credit units) including lectures on project management. A typical size of a working group has been four students. Chapter 5 introduces additional project topics that are not yet "tested". Readers unfamiliar with the chess terminology used in this paper may consult e.g. [2]. 2. Correspondence chess companion A correspondence chess player must keep track of the paper work of several simultaneous
End of preview. The entire article is 4 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/programming-projects-on-chess-JcK0X1QnUR
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Programming projects on chess
Mäkinen, Erkki
Follow ACM SIGCSE Bulletin
, Volume 28 (4)
Association for Computing Machinery – Dec 1, 1996
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
