DOCSLIB.ORG

Chessics, Whi.Ch I Hope Tb Publistr As a Supplement Eventually

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chessics, Whi.Ch I Hope Tb Publistr As a Supplement Eventually ISSN A142-7342 Last issue of Volume One CT{_ESSICS L6 INDEXES THE JOURML OF GENERALISED CHESS llultL le Un uLra Arran etnentt 6L6. W. H. DUCE 6T7. S. YLIKARIULA KB ( 63) ',12 KS (128) 740 618. S. YLIKARIULA 619. S. YLIKAzuULA RB ( 32) 35 KQRBS (240) 288 'i.l;i'l'i'l.i lA :.:.:.:.:.:.:. :;:;:i;;:i:j:; (1) j:i:i:;:i:i:j: ..:-:.:.:.:.: c= :.:.:.:-:.:.:. ::0i:: In these construction tasks, first introduced in Chessics L3, you are to arrange A pieces of type A, B pieces of -tlpe B, -... so that AxB... is as great as possible. The pievibus record in each case is shown first in paientheses. Further new iecords follow on Pag es 2 and 3. A11 conespondence and subscriptions to: G. P.JELLISS, 1 GIBSON DRIVE, RUGBY, CV27 4U, WARWICKSHIRE, ENGLAND. Price 50p per issue (92 for four). Subscriptions must be in ste4ing." Giro accbfnt number: 43 1?1 3ZOO. Exclianges welcome. @ CHESSICS ].6, 2 M.U.A. 620. S. YLIKARIULA 62L. S. YLIKARIULA 622. S. YLIKARIULA KQR (40) 48 KQB ( 64) e0 KQS 02) LzB siiii:iiiiii::i s:iiiiiiii:iii: :1:;:;i;i;i;i :i::i::::::::: .1,.t :::::::::i:::: \ L| :.:.:':.:.:.:. :i':':,::::i:: ;:;i;:;i;i;i;i 623. S. YLIKARIULA 624. W. H. DUCE 625O S'YLIKARIULA KRB ((6 64) 100 KRS (24q 256 KBS (480) 504 6?6. W. H. DUCE 627. S. YLIKARIULA 628. S. YLIKARIULA Qns ( 32) 48 QBS (48) 84 RBS (192) 270 i:fii,' CI :'r0l.. e',,.i:,i:.':'. 2.'i:..i:.::ii a,iiCI:' l'ii:i:.:i:::i ::iCI:. a ri.iii::.:i::: :.:.:.;.:.:.:. r.:.:.:.:.:.:. :;.;:;i;:;i;i; i;:;i;:;:;:;:; q4g ,l ,::ii:ii'lli: :.i:.liii':.. :"'i,';,,,"",';i,'fo|f;i|'', 'i'i;l;i;i'i;i i.i;i.i.i':.: i;i;l.i.i;i.:. :.:.:1:;i-i.i.l{ ;:,',,':,:,:,: ,,,,,:,,,,,'.' ,.ffi, i,i,:':,:,:,: ..':.::':':.: '....:..'.-:-.:-.: 7l .:-:.:.:.:.:.:. :.:.:.:':.:.: :,:,:,:,:,:,:: :,:':;:':,i,:' ,:,I-4,:: ::::::::::::i ;i;l;i;i1i;i;: ;:;i;i;i;i;l;i F1 ;i;i.i;:;l;i;i; :.:.:-:.:.:.: 'i':,:':,:,:,: :.:i:i:i:::,: 1,1,;,1;,,,,1;, a,:.::,:,::.:'' ',',:,,,.,',', h ,,t,;,,t,t,,;t,;, 4:l:l:ii:i::::: g..i;i;i;i;i1l; ;i;t;i;i;i;i; :;:;:1.1:;i;.; :i:::i:i:::::: :::::::i:::::i .-.'.:.:..'. ::::::::::::::',',.,:,i,,:,' €J :;,:':,,;:.;. ,:1i::::::;i: E:J :l',fii',,, ..:::iii:i::: i.::::,'..:'.: A,:.:,.,..'..., :: h 6 tl:: [;1 ;:1:,:;:;:;:; !! ,:i:;:;:;:;:;: H ;:;.;:;:j:;::: ii0.il. 2',1:ii,:,:,,,it0 :lii:i::i:::ii I :::ol: M. U.A. CHESSICS 16, 3 629. S. YLIKARIULA 630. S. YLIKARIULA 631. S. YLIKARIULA KQRB ( 32) B0 KQRS ( 120) 168 KQBS ( B0) 280 il:,iblti ;::.?-::: :::':;:::::.::6 :;i;i;l;i1l;:; r 'i;l;1;i;i;i;: 632. S. YLIKARIULA 633. S. YLIKARIULA 634. G. P. JELLISS KRBS (5121 560 QRBS (e6) 108 P1ace 6Q and 48 in M. U.A The front cover shows tlree new two-pi.ece records. The other nro-piece records, whictt still stand, are: KQ = KR = 40, QB =Qg = 30. QR = 16, RS = 64, BS = 112. Of the original three and four piece tasks only my QRB = 36 rezult survives the on- slaughtof"mesrsDuceandYlikarjula. MrDrice'iresultswerecirculatedinoneof his last communications to: the Fairy Ches Correspondence Circte before it closed in L982. M Ylikarjula's elmpreherisive results wdre sent to me on 29 December L982, some of his results equiUeA those of Mr Duce but the/record must stay witli W. H. D. Similarly Mr A. Willmott sent a result on 27 May-suggests 1983 whidt equalled the KB S record bi S. Y. with an identical position, which that 504 must probably be ttre ultimate atrainable in this case. But I still suspect that furttrer idvanc6ment of some of the records can be achieved. The final diagram shows another approach to multiple unguard arrangements that may be worth-pursuing. The diagrdmmed posirion is ttre 6NLy soluti-on, apart from rotdtions and r6flectioins, other Exampleswittr ttris properry are B2s; ae +ior. Can other examples be found? The prbduct does not have do be maximum. CHES$CS 16, 4 goluti,onr to Chettict | , AFTER I.E.DRIVER 550. (a) 1Qe6 Lc3+ 2Bd6 Lc6 mate. (b) LQf5 td4+ 2Bf4ll,2 mate. 551. (a) 1Bd4 Ge6+ 2Re5 Ge4 mate. 1b1 LBcS Gf?+ 2Rd? Gc? mate. Cook: 1Bc5 Gf'/+ 2Rhb Gf5 mate. (D.Nixon). Add BP g5? 552. (a) LBc5 Ge4+ 2Qc4+ Gc2 mate. (b) 1Bd6 Gf3+ 2Qe6+ Gf6 mate. D.N. points out that the WK e8 is in check from the BGeS. It will have to be repl.aced by,two WKs at h? and h8. The WKs just stop the BQ wandering off to unhelpful places. SEMOR CITIZEN 553. 1Pg5 Pd3 2Pg4 Pd4 3Pg3 Pc4 4Ph,3 Pc5 5Ph2 Pb5 6Pg2 Pb6 ?Pg1-B Pa6 8Ba? PxP mate. WP has to dawdle on first move. 554. lPhb Pdg 2Ph4 Pd4 3Ph3 Pe4 4Ph2 Pf4 5Pg2 Pf5 6Pf2 Pgl 7Pe2 Pg6 8Pd2 Ph6 9Pc2 Ph? 10Pb2 Pe? LlPa2Pf'l L2Pa3Pe? 13Pa4 Pd? 14Pa5 Pc? L5 Pa? Pb?. Each pensioner palses ttuough the other's initial square. m-ove was BP 555. (a) LP'a6 stalemlte. Black's-lasi letiring ^t9 {1. _ iti rpas pcl zpag pd6 .. 4Pa2 Pf6 . .6Pa4 Ph6 . ..- 8Pa7 Ph8=VQ. (c) ffUS (retiring) Pa6 or a5 2PxP (e. P.) Ka? 3Pb6+ and so on. The WP tiere. moles in all directiohs accept the'usuall GMSSHOPPER GALLERY and 1.Kb? Rb1 2.Qa'l Bg2*.-. 556. l.Qb? Ga6 2.Kxa6 Ra1#. M') 5 57. i.dfa [ao z.'c"i no++. i"o i.cus Rbl 2. ddB nbs"*. rine minning(I'w' 55 B. r. SsZ Che 2.BfB Ge81. 1. Bf6 GE? 2.Bxh4 Sf4+. 1. Be5 Gf6 2.8f4 Gf\+. r.nE+ ces 2.BeB Ge2*. 1.8c3 (a+z.Bdz Gdl+. 1.Bb2 g7l 2.8c1 Gd1#. Dual: 1Bd4 GeS 2Se? Ge8* (J.W. Murkin). A happy task (D.N.) 559. 1Sf?l Ke4 2Ge6 Kd3 3Gc4 Pd4 4Se5+ Where does F.M.M. find Pd4 2Gp8 Ke4 3Ge6 Kdg 4Se5+ them all froml (J.W. M.) 5 60. 1Kd2 Gc1 ZreIZ OOt 3Kf2 Gel4Ks1 Gfl+ 5Kh1 Ge1* cook: 1Kd2 Ke4 2KeL/2 CgS sKfI/z Kh3 4Kg1 CgS Srirr Gg2l (I.W.M.) Correction: Liie ttre Gs up-on h6, h5, h4 inst-ead- Same play asintended. This was intended as a companion for a T.R.Dawson problem: from PFCS october 1932: WKf3. BKf6; wcs f,5, e2, 92. Helpmate in 5 by: 1Ke5 Gh5 2Kh4 Kfz 3Khg Gd1 4Kh2 KfL+ 5Kh1 Gf3+. Is it posd.ble to coinpose a twi.n strowing the nvo different mates with this force? 5 61. 1.Gc5 Gf4 2.K65 (tempo) Kb5 3.Kdb Sg5 (Sc5?) 4.Ge5 Pe4*. 562. 1... Kd4 2.Kf5 Kb5 3;Ka4 Sd6+. 1.Gd4 Kf4 2.Kd5 Kg5 3.Ke4 Sf6#+ echo 5 63. 1... Sc6 2.Sf4 Sd4 3.Gd5 Pe4 4.592+. 1.Ga5 Sd5 2.Sd4 Sf4 3.Gf5 Pe4 4.Sc2#. echo 5 64" 1.Rg4 (Rgs?) Gf5 2.Rg5 Ghs 3. Rf5 (Rf4?) Gez 4.N4 Gc4*. BR circuit. Fine - tempted to promote d3. (J. W. M. ) 9olverr The feading solver in Chessics 15 is Mr J.W. Murkin with a score of 58, which just puts him ahead of Mr D. Nixon who scored 55. CHESSICS 16, 5 GMSSHOPPER TOURS 565. Toui dialrammed in text. 566. Ttris tour was ,"t by T. R. Dawson in chess Amateur, Jan 19.27, ---- "-problem reason did not-pub- Uut ire wrote in fiiry", btress Revi'ew, Aug 1950: "Ttre I - lish the solurion of 6ZSS in the GA is be-cause I solved it only a month ago"l 56?. Gi was diagrammed, 1b1. (c), (d) are diagrammed below. Ihe tours 567 (a) - (d) are all by T.w. \4ABLOq and.sho-w Grasstropper and 2, 3, .i,-oiS ii"toniry nooirs placed 6n the board so ttrat the G, in a seri.es of moves, cin visit as many squarei as posible in as few moves as possibler. J-0, 9, 11. In ( c)^ 9'-10'-?t 11' o In (b) proceed: . 9r . -t ' ' ' ' ',' '^2-3' \8'?3118' ?5' ' ' In (d):'... ,Z0rtirZirzzrzgr22r?+rir25r.. o ,28r27 r29, 30 r29r 31r 32, 31, 331 .. GRA SSHOPPER A SY MME TRICS 568. Left: 1a; L,Bfg GeZ 2.88!!{3* 3.KtI5 Wg *' iui r- sft* *qb 2."GeL Be4 C. Ph4+ rc--trs 4.sg3{. pd4 mates. night) i. sfiE" z- zTcda Bg4 sl cha Bfg 4. Be4 5. se3#. Ideal 569. (a) tBe4 Gd3 2Bh7 KxhB 3ch6_Kgs aBg-6 Gh3* ini 1Kg6 Gxh3 2Kh6 Kg3 gchb Kg 4Gh7 Phs*. Echo ideals. i.'W. lrf., re:rding the line under ilre diagram (which applies to 568) interchanged Bhl and Gh? and found: 1Kxh3 GhG 2K...h2 8g6 3Kg3i 5?0. upper: 1.Kl]s rg! ?._!q!-G19 3._Sg4 qh_3 4.Pg!.gfqt'.. Lower: L. Gd4 Pds 2.Kd5: Sf6+ 3.xc5 GeA 4.-Sd5 Sd?+. 5?1. (a) L. Sf4+ Keb 2.GgA Rf6 3.596 Sg3.4.Kc6 Sfs 5.W4+. ab) 1.RfO Ne6 2.Ke5 KcG 3.Nfb P{4+. Near echo ideal mates. sTz. i.'Sfg Bbs 2,Ga4 GeS g.Gf4 C"eg 4.Gdz Bd3 5. sg5#. Ideal. b?9. Upper: 1.Sc4 KaAJ' 2. Ses GdO 3.Kc4 Gf4 4.Kdf Kbs 5.8e6 Pe lL. L6wer: 1"PbL=B Ka3 2.8e4 Gd5 3.Kc3 Gf3 4.Kd4 Kb4 5. Be5 Pe3*. golving P1ease note that there are no problems for solving in this issue. since it is the last issue in Vo1ume 1, wtrich is therefore compl-ete in itself.
Load more

Recommended publications
  • B. G. Laws: the Artistry of the Chess Problem (1923)
    The Artistry of the Chess Problem with special reference to the beauties of the three- and four-mover by B. G. Laws [ 1923 ] An Electronic Edition Anders Thulin, Malmö 2008-04-12 NOTES TO ELECTRONIC EDITION The main change in this edition is the use of modern algebraic nota- tion, using the letter ‘S’ to represent the knight. The notation used in the original is a mixture between algebraic and descriptive. All problems have been computer tested – any inadvertencies have been documented in brackets in the solutions. Some minor notation mixups have been silently corrected. The obvious misprint of a white Queen instead of a white Rook on d2 in the Geyerstam three-mover has also been corrected, as well as the name of the creator of the Indian problem, which was given as Rev. C. Loveday. One oddity was discovered during testing. The Chocholouš four- mover lacks a solution: it turns out that it appears here in a different form than that it was originally given. The reason for the change is not known. The original form is as follows: cuuuuuuuuCG. Chocholouš {WDWDWDKD} {hWDWDWHW} {WDWDWDWD} {DPDWiW0N} {WDWDWDW)} {DnDQDWDW} {W4WDWDWD} {DWDWDWDW} vllllllllVMate in four BEAUTY IN THE THREE-MOVER By B. G. Laws In considering the Chess Problem with a view to appreciating its qual- ities, three essentials must be borne in mind: difficulty, idea and con- struction. Each of these is complementary of the others. Difficulty is placed first mainly for the purpose of disposing of that subject before dealing with the other two. It can hardly be suggested that there is beauty in this quality considered alone; but the causes which create this feature may be beautiful, such as the latent chess truth being ob- scured by skilful deployment of the men.
    [Show full text]
  • Bibliography of Traditional Board Games
    Bibliography of Traditional Board Games Damian Walker Introduction The object of creating this document was to been very selective, and will include only those provide an easy source of reference for my fu- passing mentions of a game which give us use- ture projects, allowing me to find information ful information not available in the substan- about various traditional board games in the tial accounts (for example, if they are proof of books, papers and periodicals I have access an earlier or later existence of a game than is to. The project began once I had finished mentioned elsewhere). The Traditional Board Game Series of leaflets, The use of this document by myself and published on my web site. Therefore those others has been complicated by the facts that leaflets will not necessarily benefit from infor- a name may have attached itself to more than mation in many of the sources below. one game, and that a game might be known Given the amount of effort this document by more than one name. I have dealt with has taken me, and would take someone else to this by including every name known to my replicate, I have tidied up the presentation a sources, using one name as a \primary name" little, included this introduction and an expla- (for instance, nine mens morris), listing its nation of the \families" of board games I have other names there under the AKA heading, used for classification. and having entries for each synonym refer the My sources are all in English and include a reader to the main entry.
    [Show full text]
  • A Heuristic Algorithm for Kriegspiel
    Master Thesis Czech Technical University in Prague Faculty of Electrical Engineering F3 Department of Computer Science A Heuristic Algorithm for Kriegspiel Bc. Vojtěch Foret Supervisor: Ing. Michal Šustr May 2021 ctuthesis t1606152353 ii MASTER‘S THESIS ASSIGNMENT I. Personal and study details Student's name: Foret Vojtěch Personal ID number: 456991 Faculty / Institute: Faculty of Electrical Engineering Department / Institute: Department of Computer Science Study program: Open Informatics Specialisation: Artificial Intelligence II. Master’s thesis details Master’s thesis title in English: A heuristic algorithm for Kriegspiel Master’s thesis title in Czech: Heuristický algoritmus pro Kriegspiel Guidelines: 1. Make a literature overview of algorithms for solving large games of imperfect information, with the emphasis on Kriegspiel [1]. 2. Implement the game and reimplement a state-of-the art algorithm [2] as a baseline in OpenSpiel [3]. 3. Implement a new algorithm, based on sampling compatible boards [4] and evaluating them with a traditional chess engine [5] as a heuristic for the value function. 4. Evaluate the algorithms in pair-wise matches to compute a statistically significant result. Bibliography / sources: [1] Li, David Hsiang-fu. Kriegspiel: Chess Under Uncertainty. Premier Publishing Company, 1994. [2] Paolo Ciancarini, Gian Piero Favini, Monte Carlo tree search in Kriegspiel, Artificial Intelligence, Volume 174, Issue 11, Pages 670-684, 2010. [3] Lanctot M, Lockhart E, Lespiau JB, Zambaldi V, Upadhyay S, Pérolat J, Srinivasan S, Timbers F, Tuyls K, Omidshafiei S, Hennes D. OpenSpiel: A framework for reinforcement learning in games. arXiv preprint arXiv:1908.09453. 2019 Aug 26. [4] Ciancarini P, Favini GP. Representing Kriegspiel States with Metapositions.
    [Show full text]
  • No. 123 - (Vol.VIH)
    No. 123 - (Vol.VIH) January 1997 Editorial Board editors John Roycrqfttf New Way Road, London, England NW9 6PL Edvande Gevel Binnen de Veste 36, 3811 PH Amersfoort, The Netherlands Spotlight-column: J. Heck, Neuer Weg 110, D-47803 Krefeld, Germany Opinions-column: A. Pallier, La Mouziniere, 85190 La Genetouze, France Treasurer: J. de Boer, Zevenenderdrffi 40, 1251 RC Laren, The Netherlands EDITORIAL achievement, recorded only in a scientific journal, "The chess study is close to the chess game was not widely noticed. It was left to the dis- because both study and game obey the same coveries by Ken Thompson of Bell Laboratories rules." This has long been an argument used to in New Jersey, beginning in 1983, to put the boot persuade players to look at studies. Most players m. prefer studies to problems anyway, and readily Aside from a few upsets to endgame theory, the give the affinity with the game as the reason for set of 'total information' 5-raan endgame their preference. Your editor has fought a long databases that Thompson generated over the next battle to maintain the literal truth of that ar- decade demonstrated that several other endings gument. It was one of several motivations in might require well over 50 moves to win. These writing the final chapter of Test Tube Chess discoveries arrived an the scene too fast for FIDE (1972), in which the Laws are separated into to cope with by listing exceptions - which was the BMR (Board+Men+Rules) elements, and G first expedient. Then in 1991 Lewis Stiller and (Game) elements, with studies firmly identified Noam Elkies using a Connection Machine with the BMR realm and not in the G realm.
    [Show full text]
  • The 5Th Belgrade Chess Problems Festival Report by Milan Velimirović the Fifth Successive Festival Took Place from 2Nd to 4Th of May 2008
    Mat Plus Review Summer 2008 The 5th Belgrade Chess Problems Festival Report by Milan Velimirović The fifth successive Festival took place from 2nd to 4th of May 2008. As usual a good number of guests from abroad were welcomed: Dinu-Ioan Nicula (ROM), Aleksander Leontyev (RUS), Andrey Selivanov (RUS), Eric Huber (ROM), Fadil Abdurahmanović (BIH), Iļja Ketris (LAT), Ivan Denkovski (MAK), Kostas Prentos (GRE), Michal Dragoun (CZE), Piotr Murdzia (POL), Valery Kopyl with his lovely daughter Valeria (UKR) and Živko Janevski (MAK). You may have noticed the exception from the alphabetical order of that list, but there is a good reason for it: Dinu-Ioan Nicula is the only foreign composer who has attended all five Festivals, and if he comes again next year the organizers could consider the idea of promoting him into an honorary participant. Anyway, all guests have been treated by the home team in a traditionally warm and friendly way. For the record, the participants from Serbia were: Bogoljub Trifunović, Borislav Gađanski, Borislav Ilinčić, Božidar Brujić, Božidar Šoškić, Branislav Đurašević, Darko Šaljić, Dragoljub Đokić, Goran Janković, Goran M. Todorović, Goran Škare, Igor Spirić, Joza Tucakov, Marjan Kovačević, Mihajlo Milanović, Milan Velimirović, Miodrag Radomirović, Mirko Miljanić, Nikola Miljaković, Nikola Petković, Petar Opening speech: Milan Milićević, president Šoškić, Radomir Mićunović, Slobodan of Chess club “Beograd Beopublikum”, Šaletić, Stevan B. Bokan, Tomislav Petrović, accompanied by Marjan Kovačević Vladimir Podinić and Zoran Sibinović. The programme was very busy and here is a brief report of all the events. Friday, May 2nd, 16:00. All participants were allowed to take part in a Machine Gun Solving event.
    [Show full text]
  • Dutchman Who Did Not Drink Beer. He Also Surprised My Wife Nina by Showing up with Flowers at the Lenox Hill Hospital Just Before She Gave Birth to My Son Mitchell
    168 The Bobby Fischer I Knew and Other Stories Dutchman who did not drink beer. He also surprised my wife Nina by showing up with flowers at the Lenox Hill Hospital just before she gave birth to my son Mitchell. I hadn't said peep, but he had his quiet ways of finding out. Max was quiet in another way. He never discussed his heroism during the Nazi occupation. Yet not only did he write letters to Alekhine asking the latter to intercede on behalf of the Dutch martyrs, Dr. Gerard Oskam and Salo Landau, he also put his life or at least his liberty on the line for several others. I learned of one instance from Max's friend, Hans Kmoch, the famous in-house annotator at AI Horowitz's Chess Review. Hans was living at the time on Central Park West somewhere in the Eighties. His wife Trudy, a Jew, had constant nightmares about her interrogations and beatings in Holland by the Nazis. Hans had little money, and Trudy spent much of the day in bed screaming. Enter Nina. My wife was working in the New York City welfare system and managed to get them part-time assistance. Hans then confided in me about how Dr. E greased palms and used his in­ fluence to save Trudy's life by keeping her out of a concentration camp. But mind you, I heard this from Hans, not from Dr. E, who was always Max the mum about his good deeds. Mr. President In 1970, Max Euwe was elected president of FIDE, a position he held until 1978.
    [Show full text]
  • No Slide Title
    112 CONTENTS StrateGems 2011 h#n Award………………………………………. 58 Danka Petkova-90MT Award……………………………………… 59 Repeat the Sounding Joy……………………………………………63 The quest for a King-only proof game…….………………………. 66 Recently Honored US Compositions ……………………….……... 69 Original compositions and SG53 solutions……………………...… 71 StrateGems StrateGems Solving Ladder 2011, Leg 26 ………………...……… 93 StrateGems 2011 Solving Championship………………………….. 95 Four of a Kind……………………………………………………… 95 Petko A. Petkov Jubilee Tourney Award (PAP-70JT)…………….. 96 Recent Tourney Winners……………………………..……………. 103 2012 StrateGems Books Library ................................................................111 EDITORS Chief Editor: Mike Prcic, 2613 Northshore Lane, Westlake Village, CA 91361-3318, [email protected] #2 Editor: Aaron Hirschenson 6 Nizana Street, Metar 85025, Israel, [email protected] #3 Editor: Rauf Aliovsadzade 5600 Randolph St. Lincoln, NE 68510, [email protected] #n Editor: Richard Becker 510 Pleasant Ave. Oregon City, OR, 97045, [email protected] Studies Editor: Franjo Vrabec Blåkullagatan 31C, 25457 Helsingborg, Sweden, [email protected] Helpmates Editor: Nikola Stolev Buković 3a, n. Lisice, 1000 Skopje, Macedonia, [email protected] Series-Movers and Stalemates Editor: Radovan Tomašević Djure Salaja 19b/4, SRB-19000 Zajecar, Serbia, [email protected] Selfmates and Fairies Editor: Petko A. Petkov Janko Sakazov N 38, whod W, 1504-Sofia, Bulgaria, [email protected] nN Retros and Proof Games Editor: Kostas Prentos Kleanthous 23, GR-54453 Thessaloniki, Greece, [email protected] Solutions Editor: Danny Dunn 6717 Lahontan, Ft. Worth, TX 76132, [email protected] Consultant: Dan Meinking; StrateGems Web site: www.Strategems.org Language Editor: Virginia Prcic, Contributor: Bob Lincoln SUBSCRIPTION INFORMATION StrateGems. U.S. subscribers $35 per year. Other countries $40. Good Companions Fellow $50.
    [Show full text]
  • Chapter 15, New Pieces
    Chapter 15 New pieces (2) : Pieces with limited range [This chapter covers pieces whose range of movement is limited, in the same way that the moves of the king and knight are limited in orthochess.] 15.1 Pieces which can move only one square [The only such piece in orthochess is the king, but the ‘wazir’ (one square orthogonally in any direction), ‘fers’ or ‘firzan’ (one square diagonally in any direction), ‘gold general’ (as wazir and also one square diagonally forward), and ‘silver general’ (as fers and also one square orthogonally forward), have been widely used and will be found in many of the games in the chapters devoted to historical and regional versions of chess. Some other flavours will be found below. In general, games which involve both a one-square mover and ‘something more powerful’ will be found in the section devoted to ‘something more powerful’, but the two later developments of ‘Le Jeu de la Guerre’ are included in this first section for convenience. One-square movers are slow and may seem to be weak, but even the lowly fers can be a potent attacking weapon. ‘Knight for two pawns’ is rarely a good swap, but ‘fers for two pawns’ is a different matter, and a sound tactic, when unobservant defence permits it, is to use the piece with a fers move to smash a hole in the enemy pawn structure so that other men can pour through. In xiangqi (Chinese chess) this piece is confined to a defensive role by the rules of the game, but to restrict it to such a role in other forms of chess may well be a losing strategy.] Le Jeu de la Guerre [M.M.] (‘M.M.’, ranks 1/11, CaHDCuGCaGCuDHCa on ranks perhaps J.
    [Show full text]
  • Final Award Booklet
    WORLD FEDERATION FOR CHESS COMPOSITION 10 th WORLD CHESS COMPOSITION TOURNAMENT 2016-2017 FINAL AWARD December 2017 WORLD FEDERATION FOR CHESS COMPOSITION 10 КОМАНДНЫЙ ЧЕМПИОНАТ МИРА 2016-2017 ОКОНЧАТЕЛЬНЫЕ РЕЗУЛЬТАТЫ Декабрь 2017 In Memoriam Aleksandr Manvelyan ARM (04.06.1946 - 21.06.2015) Philippe Robert FRA (02.08.1938 - 17.04.2016) Miroslav Šindelář CZE (28.09.1948 - 09.06.2016) Albert Ivanov MDA (05.10.1937 - 07.11.2016) Viktor Aberman USA (03.10.1953 - 08.11.2016) Josef Kupper SUI (10.03.1932 - 05.06.2017) 4 TABLE OF CONTENTS In Memoriam ...................................................................................................................................... 4 INDEX OF AUTHORS ....................................................................................................................... 8 BEST INDIVIDUAL SCORES ........................................................................................................ 13 BEST INDIVIDUAL PRESENTATION RATING ...................................................................... 13 RESULTS .............................................................................................................................................. 14 NUMBER OF ENTRIES PER COUNTRY ................................................................................... 15 SECTION A: TWOMOVERS .......................................................................................................... 16 Section A: Twomovers - Table .........................................................................................................
    [Show full text]
  • Monte Carlo Tree Search in Kriegspiel ∗ Paolo Ciancarini , Gian Piero Favini
    Artificial Intelligence 174 (2010) 670–684 Contents lists available at ScienceDirect Artificial Intelligence www.elsevier.com/locate/artint Monte Carlo tree search in Kriegspiel ∗ Paolo Ciancarini , Gian Piero Favini Dipartimento di Scienze dell’Informazione, University of Bologna, Italy article info abstract Article history: Partial information games are excellent examples of decision making under uncertainty. In Received 20 September 2009 particular, some games have such an immense state space and high degree of uncertainty Received in revised form 4 April 2010 that traditional algorithms and methods struggle to play them effectively. Monte Carlo tree Accepted 4 April 2010 search (MCTS) has brought significant improvements to the level of computer programs Available online 9 April 2010 in games such as Go, and it has been used to play partial information games as well. Keywords: However, there are certain games with particularly large trees and reduced information Games in which a naive MCTS approach is insufficient: in particular, this is the case of games Chess with long matches, dynamic information, and complex victory conditions. In this paper we Kriegspiel explore the application of MCTS to a wargame-like board game, Kriegspiel. We describe and Incomplete information study three MCTS-based methods, starting from a very simple implementation and moving Monte Carlo tree search to more refined versions for playing the game with little specific knowledge. We compare these MCTS-based programs to the strongest known minimax-based Kriegspiel program, obtaining significantly better experimental results with less domain-specific knowledge. © 2010 Elsevier B.V. All rights reserved. 1. Introduction Partial information games provide a good model and testbed for many real-world situations involving decision mak- ing under uncertainty.
    [Show full text]
  • Glossary of Chess
    Glossary of chess See also: Glossary of chess problems, Index of chess • X articles and Outline of chess • This page explains commonly used terms in chess in al- • Z phabetical order. Some of these have their own pages, • References like fork and pin. For a list of unorthodox chess pieces, see Fairy chess piece; for a list of terms specific to chess problems, see Glossary of chess problems; for a list of chess-related games, see Chess variants. 1 A Contents : absolute pin A pin against the king is called absolute since the pinned piece cannot legally move (as mov- ing it would expose the king to check). Cf. relative • A pin. • B active 1. Describes a piece that controls a number of • C squares, or a piece that has a number of squares available for its next move. • D 2. An “active defense” is a defense employing threat(s) • E or counterattack(s). Antonym: passive. • F • G • H • I • J • K • L • M • N • O • P Envelope used for the adjournment of a match game Efim Geller • Q vs. Bent Larsen, Copenhagen 1966 • R adjournment Suspension of a chess game with the in- • S tention to finish it later. It was once very common in high-level competition, often occurring soon af- • T ter the first time control, but the practice has been • U abandoned due to the advent of computer analysis. See sealed move. • V adjudication Decision by a strong chess player (the ad- • W judicator) on the outcome of an unfinished game. 1 2 2 B This practice is now uncommon in over-the-board are often pawn moves; since pawns cannot move events, but does happen in online chess when one backwards to return to squares they have left, their player refuses to continue after an adjournment.
    [Show full text]
  • Finding Aid to the Sid Sackson Collection, 1867-2003
    Brian Sutton-Smith Library and Archives of Play Sid Sackson Collection Finding Aid to the Sid Sackson Collection, 1867-2003 Summary Information Title: Sid Sackson collection Creator: Sid Sackson (primary) ID: 2016.sackson Date: 1867-2003 (inclusive); 1960-1995 (bulk) Extent: 36 linear feet Language: The materials in this collection are primarily in English. There are some instances of additional languages, including German, French, Dutch, Italian, and Spanish; these are denoted in the Contents List section of this finding aid. Abstract: The Sid Sackson collection is a compilation of diaries, correspondence, notes, game descriptions, and publications created or used by Sid Sackson during his lengthy career in the toy and game industry. The bulk of the materials are from between 1960 and 1995. Repository: Brian Sutton-Smith Library and Archives of Play at The Strong One Manhattan Square Rochester, New York 14607 585.263.2700 [email protected] Administrative Information Conditions Governing Use: This collection is open to research use by staff of The Strong and by users of its library and archives. Intellectual property rights to the donated materials are held by the Sackson heirs or assignees. Anyone who would like to develop and publish a game using the ideas found in the papers should contact Ms. Dale Friedman (624 Birch Avenue, River Vale, New Jersey, 07675) for permission. Custodial History: The Strong received the Sid Sackson collection in three separate donations: the first (Object ID 106.604) from Dale Friedman, Sid Sackson’s daughter, in May 2006; the second (Object ID 106.1637) from the Association of Game and Puzzle Collectors (AGPC) in August 2006; and the third (Object ID 115.2647) from Phil and Dale Friedman in October 2015.
    [Show full text]