DOCSLIB.ORG

1 Ii.023.1.2019.Kw Sprawozdanie Z Działalności Jednostki Za

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
1 Ii.023.1.2019.Kw Sprawozdanie Z Działalności Jednostki Za II.023.1.2019.KW SPRAWOZDANIE Z DZIAŁALNOŚCI JEDNOSTKI ZA ROK 2018 Nazwa jednostki: Instytut Informatyki Skrócona nazwa jednostki np. akronim: II Uprawiane dyscypliny naukowe: informatyka Dane adresowe Ulica: F. Joliot-Curie Telefon: 071 375 7800, 071 325 1271 Nr domu: 15 Kod pocztowy: 50-383 Fax: 071 375 7801 Miejscowość: Wrocław E-mail: [email protected] Kierownik jednostki Nazwisko i imię: Jerzy Marcinkowski Telefon służbowy: 071 375 70 34 Stanowisko służbowe: dyrektor Fax: 071 375 7801 Tytuły i stopnie naukowe: prof. dr hab. E-mail: [email protected] 1 Dane liczbowe o składzie Rady Naukowej Liczba członków ogółem: 18 - w tym członków z tytułem prof. oraz dr hab.: 13 Liczba członków spoza jednostki: 0 Zatrudnienie Zatrudnionych ogółem: 64 - w tym nauczycieli akademickich: 48 z tytułem profesora: 4 na stanowisku profesora nadzwyczajnego: 9 ze stopniem dr. hab.: 2 ze stopniem dr.: 14 asystentów: 1 wykładowców: 9 (dr) + 4 (mgr) adiunkt naukowy: 4 (dr) + 1 (mgr) - w tym nienauczycieli: 16 pracowników technicznych: 5 pracowników administracyjnych: 5 innych: 6 - w tym nienauczycieli z wykształceniem wyższym: 6 średnim: 4 zawodowym i podstawowym: 6 2 Uprawnienia do nadawania stopni naukowych Czy jednostka posiada uprawnienia do nadawania stopni doktora: Tak (w ramach Wydziału) Czy jednostka posiada uprawnienia do nadawania stopni doktora habilitowanego: Tak (w ramach Wydziału) Podać rodzaj i zakres uprawnień Stopnia doktora: nauk matematycznych - w zakresie: informatyki Podać rodzaj i zakres uprawnień Stopnia doktora habilitowanego: nauk matematycznych - w zakresie: informatyki Liczba nadanych stopni dr w okresie sprawozdawczym ogółem (w tym kobiety): 1 (0) w tym: - pracownicy: Michał Różański (25.09.2018) - doktoranci: 0 - osoby spoza Uczelni: 0 Liczba nadanych stopni dr hab. w okresie sprawozdawczym ogółem (w tym kobiety): 1 (0) w tym: - pracownicy: Piotr Wnuk-Lipiński (16.01.2018) - osoby spoza Uczelni: 0 Liczba nadanych tytułów prof. w okresie sprawozdawczym ogółem (w tym kobiety): 0 (0) w tym: - pracownicy: 0 - osoby spoza Uczelni: 0 Liczba uzyskanych stopni dr poza Uczelnią ogółem (w tym kobiety): 0 (0) Liczba uzyskanych stopni dr hab. poza Uczelnią ogółem (w tym kobiety): 0 (0) Liczba uzyskanych tytułów prof. poza Uczelnią ogółem (w tym kobiety): 0 (0) 3 Kilka najważniejszych osiągnięć naukowych Za najważniejsze osiągnięcia naukowe, traktowane równorzędnie, uznaje się następujące prace (kolejność alfabetyczna): Byrka Jarosław, Sornat Krzysztof, Spoerhase Joachim Andreas Constant-factor approximation for ordered k-median / Jarosław Byrka, Krzysztof Sornat, Joachim Andreas Spoerhase // W: STOC'18 : Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing : June 25-29, 2018, Los Angeles, CA, USA / editors: Ilias Diakonikolas, David Kempe, Monika Henzinger. - New York : ACM, 2018. - S. 620-631. - Dostęp do abstraktu: https://doi.org/10.1145/3188745.3188930. Abstract. We study the Ordered k-Median problem, in which the solution is evaluated by first sorting the client connection costs and then multiplying them with a predefined non-increasing weight vector (higher connection costs are taken with larger weights). Since the 1990s, this problem has been studied extensively in the discrete optimization and operations research communities and has emerged as a framework unifying many fundamental clustering and location problems such as k-Median and k-Center. Obtaining non-trivial approximation algorithms was an open problem even for simple topologies such as trees. Recently, Aouad and Segev (2017) were able to obtain an O(log n) approximation algorithm for Ordered k-Median using a sophisticated local-search approach. The existence of a constant-factor approximation algorithm, however, remained open even for the rectangular weight vector. In this paper, we provide an LP-rounding constant-factor approximation algorithm for the Ordered k- Median problem. We achieve this result by revealing an interesting connection to the classic k-Median problem. In particular, we propose a novel LP relaxation that uses the constraints of the natural LP relaxation for k- Median but minimizes over a non-metric, distorted cost vector. This cost function (approximately) emulates the weighting of distances in an optimum solution and can be guessed by means of a clever enumeration scheme of Aouad and Segev. Although the resulting LP has an unbounded integrality gap, we can show that the LP rounding process by Charikar and Li (2012) for k-Median, operating on the original, metric space, gives a constant-factor approximation when relating not only to the LP value but also to a combinatorial bound derived from the guessing phase. To analyze the rounding process under the non-linear, ranking-based objective of Ordered k-Median, we employ several new ideas and technical ingredients that we believe could be of interest in some of the numerous other settings related to ordered, weighted cost functions. Dudek Bartłomiej Universal protocols for information dissemination using emergent signals / Bartłomiej Dudek, Adrian Kosowski // W: STOC'18 : Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing : June 25-29, 2018, Los Angeles, CA, USA / Editors Ilias Diakonikolas, David Kempe, Monika Henzinger. - New York : ACM, 2018. - S. 87-99. - Dostęp do abstraktu: https://doi.org/10.1145/3188745.3188818. Abstract. We consider a population of n agents which communicate with each other in a decentralized manner, through random pairwise interactions. One or more agents in the population may act as authoritative sources of information, and the objective of the remaining agents is to obtain information from or about these source agents. We study two basic tasks: broadcasting, in which the agents are to learn the bit-state of an authoritative source which is present in the population, and source detection, in which the agents are required to decide if at least one source agent is present in the population or not. We focus on designing protocols which meet two natural conditions: (1) universality, i.e., independence of population size, and (2) rapid convergence to a correct global state after a reconfiguration, such as a change in the state of a source agent. Our main positive result is to show that both of these constraints can be met. For both the broadcasting problem and the source detection problem, we obtain solutions with an expected convergence time of O(logn), from any starting configuration. The solution to broadcasting is exact, which means that all agents reach the state broadcast by the source, while the solution to source detection admits one-sided error on a ε-fraction of the population (which is unavoidable for this problem). Both protocols are easy to implement in practice and are self-stabilizing, in the sense 4 that the stated bounds on convergence time hold starting from any possible initial configuration of the system. Our protocols exploit the properties of self-organizing oscillatory dynamics. On the hardness side, our main structural insight is to prove that any protocol which meets the constraints of universality and of rapid convergence after reconfiguration must display a form of non-stationary behavior (of which oscillatory dynamics are an example). We also observe that the periodicity of the oscillatory behavior of the protocol, when present, must necessarily depend on the number #X of source agents present in the population. For instance, our protocols inherently rely on the emergence of a signal passing through the population, whose period is Θ(log(n/#X)) rounds for most starting configurations. The design of phase clocks with tunable frequency may be of independent interest, notably in modeling biological networks. Gawrychowski Paweł, Łopuszański Jakub Labeling schemes for nearest common ancestors through minor-universal trees / Paweł Gawrychowski, Fabian Kuhn, Jakub Łopuszański, Konstantinos Panagiotou, Pascal Su // W: Proceedings of the Twenty- Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 / Artur Czumaj (ed.). - Philadelphia : Society for Industrial and Applied Mathematics, 2018. - (Proceedings).- S. 2604-2619 : il. - Bibliogr. - Streszcz. w jęz. ang. - Dostęp do abstraktu: https://doi.org/10.1137/1.9781611975031.166. Abstract. Preprocessing a tree for finding the nearest common ancestor of two nodes is a basic tool with multiple applications. Quite a few linear-space constant-time solutions are known and the problem seems to be well-understood. This is however not so clear if we want to design a labeling scheme. In this model, the structure should be distributed: every node receives a distinct binary string, called its label, so that given the labels of two nodes (and no further information about the topology of the tree) we can compute the label of their nearest common ancestor. The goal is to make the labels as short as possible. Alstrup, Gavoille, Kaplan, and Rauhe [Theor. Comput. Syst. 37(3):441–456 2004] showed that O(log n)-bit labels are enough, with a somewhat large constant. More recently, Alstrup, Halvorsen, and Larsen [SODA 2014] refined this to only 2.772 log n, and provided a lower bound of 1.008 log n. We connect the question of designing a labeling scheme for nearest common ancestors to the existence of a tree, called a minor-universal tree, that contains every tree on n nodes as a topological minor. Even though it is not clear if a labeling scheme must be based on such a notion, we argue that all already existing schemes can be reformulated as such. Further, we show that this notion allows us to easily obtain clean and good bounds on the length of the labels. As the main upper bound, we show that 2.318 log n-bit labels are enough. Surprisingly, the notion of a minor-universal tree for binary trees on n nodes has been already used in a different context by Hrubes et al. [CCC 2010], and Young, Chu, and Wong [J. ACM 46(3):416–435, 1999] introduced a very closely related (but not equivalent) notion of a universal tree.
Load more

Recommended publications
  • Recovering and Rendering Vital Blueprint for Counter Education At
    Recovering and Rendering Vital clash that erupted between the staid, conservative Board of Trustees and the raucous experimental work and atti- Blueprint for Counter Education tudes put forth by students and faculty (the latter often- times more militant than the former). The full story of the at the California Institute of the Arts Institute during its frst few years requires (and deserves) an entire book,8 but lines from a 1970 letter by Maurice Paul Cronin Stein, founding Dean of the School of Critical Studies, written a few months before the frst students arrived on campus, gives an indication of the conficts and delecta- tions to come: “This is the most hectic place in the world at the moment and promises to become even more so. At heart of the California Institute of Arts’ campus is We seem to be testing some complex soap opera prop- a vast, monolithic concrete building, containing more osition about the durability of a marriage between the than a thousand rooms. Constructed on a sixty-acre site radical right and left liberals. My only way of adjusting to thirty-fve miles north of Los Angeles, it is centered in the situation is to shut my eyes, do my job, and hope for what at the end of the 1960s was the remote outpost the best.”9 of sun-scorched Valencia (a town “dreamed up by real estate developers to receive the urban sprawl which is • • • Los Angeles”),1 far from Hollywood, a town that was—for many students at the Institute—the belly of the beast.
    [Show full text]
  • Chess Camp Volume 3: Checkmates with Many Pieces Contents Note for Coaches, Parents, Teachers, and Trainers
    Igor Sukhin Chess Camp Volume 3: Checkmates with Many Pieces Contents Note for Coaches, Parents, Teachers, and Trainers ........................................................................ 5 Mate in One in the Opening Approaching the Opening ............................................................................................................... 7 Silly Games ......................................................................................................................................13 Open Games ...................................................................................................................................17 Semi-Open Games ...........................................................................................................................40 Closed Games ................................................................................................................................ 49 Mate in One in the Middlegame Pins .................................................................................................................................................55 Silly Pin Positions ............................................................................................................................57 Double Check .................................................................................................................................58 Discovered Check ...........................................................................................................................60 Attacking
    [Show full text]
  • Chess Mag - 21 6 10 18/09/2020 14:01 Page 3
    01-01 Cover - October 2020_Layout 1 18/09/2020 14:00 Page 1 03-03 Contents_Chess mag - 21_6_10 18/09/2020 14:01 Page 3 Chess Contents Founding Editor: B.H. Wood, OBE. M.Sc † Executive Editor: Malcolm Pein Editorial....................................................................................................................4 Editors: Richard Palliser, Matt Read Malcolm Pein on the latest developments in the game Associate Editor: John Saunders Subscriptions Manager: Paul Harrington 60 Seconds with...Peter Wells.......................................................................7 Twitter: @CHESS_Magazine The acclaimed author, coach and GM still very much likes to play Twitter: @TelegraphChess - Malcolm Pein Website: www.chess.co.uk Online Drama .........................................................................................................8 Danny Gormally presents some highlights of the vast Online Olympiad Subscription Rates: United Kingdom Carlsen Prevails - Just ....................................................................................14 1 year (12 issues) £49.95 Nakamura pushed Magnus all the way in the final of his own Tour 2 year (24 issues) £89.95 Find the Winning Moves.................................................................................18 3 year (36 issues) £125 Can you do as well as the acclaimed field in the Legends of Chess? Europe 1 year (12 issues) £60 Opening Surprises ............................................................................................22 2 year (24 issues) £112.50
    [Show full text]
  • Virginia Chess Federation 2008 - #6
    VIRGINIA CHESS Newsletter The bimonthly publication of the Virginia Chess Federation 2008 - #6 Grandmaster Larry Kaufman See page 1 VIRGINIA CHESS Newsletter 2008 - Issue #6 Editor: Circulation: Macon Shibut Ernie Schlich 8234 Citadel Place 1370 South Braden Crescent Vienna VA 22180 Norfolk VA 23502 [email protected] [email protected] k w r Virginia Chess is published six times per year by the Virginia Chess Federation. Membership benefits (dues: $10/yr adult; $5/yr junior under 18) include a subscription to Virginia Chess. Send material for publication to the editor. Send dues, address changes, etc to Circulation. The Virginia Chess Federation (VCF) is a non-profit organization for the use of its members. Dues for regular adult membership are $10/yr. Junior memberships are $5/yr. President: Mike Hoffpauir, 405 Hounds Chase, Yorktown VA 23693, mhoffpauir@ aol.com Treasurer: Ernie Schlich, 1370 South Braden Crescent, Norfolk VA 23502, [email protected] Secretary: Helen Hinshaw, 3430 Musket Dr, Midlothian VA 23113, jallenhinshaw@comcast. net Scholastics Coordinator: Mike Hoffpauir, 405 Hounds Chase, Yorktown VA 23693, [email protected] VCF Inc. Directors: Helen Hinshaw (Chairman), Rob Getty, John Farrell, Mike Hoffpauir, Ernie Schlich. otjnwlkqbhrp 2008 - #6 1 otjnwlkqbhrp Larry Kaufman, of Maryland, is a familiar face at Virginia tournaments. Among others he won the Virginia Open in 1969, 1998, 2000, 2006 and 2007! Recently Larry achieved a lifelong goal by attaining the title of International Grandmaster, and agreed to tell VIRGINIA CHESS readers how it happened. -ed World Senior Chess Championship by Larry Kaufman URING THE LAST FIVE YEARS OR SO, whenever someone asked me Dif I still hoped to become a GM, I would reply something like this: “I’m too old now to try to do it the normal way, but perhaps when I reach 60 I will try to win the World Senior, which carries an automatic GM title.
    [Show full text]
  • Duchamp, Chess and the Avant-Garde
    ENDGAME: DUCHAMP, CHESS AND THE AVANT-GARDE Press kit 29.10.2016—22.01.2017 Fundació Joan Miró Now I am content to just play. I am still a victim of chess. It has all the beauty of art – and much more. It cannot be commercialized. Chess is much purer than art in its social position. The chess pieces are the block alphabet which shapes thoughts; and these thoughts, although making a visual design on the chess board, express their beauty abstractly, like a poem. […] I have come to the conclusion that while all artists are not chess players, all chess players are artists. Marcel Duchamp. Address at the banquet of the New York State Chess Association in 1952 1 Contents Press release 3 Curator 9 Exhibition layout 12 Sections of the exhibition and selection of works 13 Full list of works 28 Artists and sources of the works 35 Publication 38 Activities 39 General information 41 2 Press release Endgame. Duchamp, Chess and the Avant-Garde Fundació Joan Miró 29 October 2016 – 22 January 2017 Opening: 28 October 2016, 7 pm Curator: Manuel Segade Sponsored by the BBVA Foundation The Fundació Joan Miró presents Endgame: Duchamp, Chess and the Avant-Garde, an exhibition that re-reads the history of modern art through the lens of its relationship to chess. The exhibition, sponsored by the BBVA Foundation and curated by Manuel Segade, looks at chess as a leitmotif that runs through the avant-garde, and metaphorically offers an innovative and playful insight into the history of modern art. Endgame: Duchamp, Chess and the Avant-Garde brings together around eighty works, including paintings and sculptures – some of which have never been shown before in Spain – by some of the key artists of the twentieth century, drawn from major public and private collections in Europe, America, and Middle East.
    [Show full text]
  • The Reviled Art Stuart Rachels
    The Reviled Art Stuart Rachels “If chess is an art, it is hardly treated as such in the United States. Imagine what it would be like if music were as little known or appreciated. Suppose no self-respecting university would offer credit courses in music, and the National Endowment for the Arts refused to pay for any of it. A few enthusiasts might compose sonatas, and study and admire one another’s efforts, but they would largely be ignored. Once in a while a Mozart might capture the public imagination, and like Bobby Fischer get written about in Newsweek. But the general attitude would be that, while this playing with sound might be clever, and a great passion for those who care about it, still in the end it signifies nothing very important.” —James Rachels1 Bragging and Whining When I was 11, I became the youngest chess master in American history. It was great fun. My picture was put on the cover of Chess Life; I appeared on Shelby Lyman’s nationally syndicated chess show; complete strangers asked me if I was a genius; I got compared to my idol, Bobby Fischer (who was not a master until he was 13); and I generally enjoyed the head-swelling experience of being treated like a king, as a kid among adults. When I wasn’t getting bullied at school, I felt special. And the fact that I was from Alabama, oozing a slow Southern drawl, must have increased my 2 mystique, since many northeastern players assumed that I lived on a farm, and who plays chess out there? In my teens, I had some wonderful experiences.
    [Show full text]
  • Mapping Chess Aesthetics Onto Procedurally Generated Chess-Like Games
    Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Jakub Kowalski1?, Antonios Liapis2, and Łukasz Żarczyński3 1 Institute of Computer Science, University of Wrocław, [email protected] 2 Institute of Digital Games, University of Malta, [email protected] 3 Institute of Computer Science, University of Wrocław, [email protected] Abstract. Variants of chess have been generated in many forms and for several reasons, such as testbeds for artificial intelligence research in gen- eral game playing. This paper uses the visual properties of chess pieces as inspiration to generate new shapes for other chess-like games, targeting specific visual properties which allude to the pieces’ in-game function. The proposed method uses similarity measures in terms of pieces’ strate- gic role and movement in a game to identify the new pieces’ closest representatives in chess. Evolution then attempts to minimize the dis- tance from chess pieces’ visual properties, resulting in new shapes which combine one or more chess pieces’ visual identities. While experiments in this paper focus on two chess-like games from previous publications, the method can be used for broader generation of game visuals based on functional similarities of components to known, popular games. Keywords: Procedural Content Generation, Chess Variants, Digital Aes- thetics, Evolutionary Algorithms, Simplified Boardgames 1 Introduction For over a decade, digital games have been the domain of choice for research in computational and artificial intelligence, culminating in several handbooks on the topic [1, 2]. The vast majority of the research output on this domain has been treating digital games as systems, focusing on their functional aspects.
    [Show full text]
  • Mapping Chess Aesthetics Onto Procedurally Generated Chess-Like Games
    Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ University of Wroc law, Poland University of Malta, Malta EvoGAMES 05.04.2018 Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Background Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Procedural Content Generation (PCG) Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games General Game Playing (GGP) Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Simplified Boardgames (Bj¨ornsson,2012) P (0,1,e) + (-1,1,p) + (1,1,p) + (0,1,e)(0,5,e)(0,-4,e) + ... & N (2,1,e) + (2,-1,e) + (-2,1,e) + (-2,-1,e) + (1,2,e)... & R (0,1,e)^* + (0,1,e)^*(0,1,p) + (0,-1,e)^* + ... & Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Motivation Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Procedural Content Generation for GDL Descriptions of Simplified Boardgames (Kowalski, Szykula; 2015) Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Evolving Chesslike Games Using Relative Algorithm Performance Profiles (Kowalski, Szyku la; 2016) Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Evaluating Chess-like Games Using Generated Natural Language Descriptions (Kowalski, Zarczy´nski,Kisielewicz;_ 2017) Jakub Kowalski, Antonios Liapis,Lukasz Zarczy´nski_ Mapping Chess Aesthetics onto Procedurally Generated Chess-like Games Goal The shapes evolved for one game should look similar, so that they are easily identified as parts of a whole.
    [Show full text]
  • Pages 116-128
    Appendix A: Two personal appreciations Flere follow translations of the original introductions to 64 studii z oboru vdioUich a pdicovlich koncovek and Studie. To 64 studii z oboru vdiovllch a pdicovlich koncovek by Bediich Thelen (1905-72). Thelen was little known outside his own country, but was among the leading players within it; he had a first place in an international tourney (Tapolcza Fiirdo 1926) to his credit, he achieved second place in a wartime championship of Bohemia and Moravia, and he was the captain of tl.re Czechoslovak team at the 1964 Olympiad. He published a textbook, "A detailed treatise on chess". in 1929. I have known the author of this little book for more than 40 years. Of coune, I first met him behind a chessboard. I already knew that he was a friend of the chess master Richard Rdti. And that fact in itself said a great deal to me, a very great deal... Dr Artur Mandler is a master of the chess study. A renowned rnaster! His works have something to say to chess enthusiasts, and he knows irow to say it. So I advised him to select for this collection those of his studies which would be of the greatest value to practical players, namely some of his rook and pawn studies. Was this good advice? Do not practical players find all that they need in endgame textbooks, which in any case are larger and more comprehensive? The practical player seeks usefulness, not beauty! But why, in that case, do textbooks contain so many studies? Because the effect ofan artistic work is stronger and longer-lasting than that of exhaustive notes in a textbook.
    [Show full text]
  • Exhaustive Search of Piece Combinations Based on Total Shannon Value
    electronic Journal of Computer Science and Information Technology (eJCSIT), Vol. 5, No. 1, 2015 Exhaustive Search of Piece Combinations Based on Total Shannon Value Shazril bin Azman1 Azlan Iqbal2 1, 2College of Information Technology, Universiti Tenaga Nasional, Putrajaya Campus, Jalan IKRAM-UNITEN, 43000 Kajang, Selangor e-mail: [email protected], [email protected] Abstract— In chess games, the Shannon value is one way to In this paper, we demonstrate a method to produce all the represent the relative values of chess pieces. We propose a piece combinations based on a particular TSV specified. The method to perform an exhaustive search of piece combinations piece combination consist of different possible combinations based on any given total Shannon value. Nested loops are used of queens, rooks, knights, bishops and pawns that are equal to along with certain sentinel controls that comply with the basic any given TSV and they are technically ‘legal’ in the game. rules of chess. For example, there are 9 loops assigned for the In Section II, we review some related works ranging from queen, as the maximum legal number of queens on the board is 9, including the promoted pawns. Therefore, each chess piece the historical background of the concept of permutation and (queen, rook, bishop, knight, pawn) has its own specific number its utilization in modern day applications. Section III of loops which correspond to its legal number and they are describes the method towards generating the piece nested in together. The experiment performed shows that if combination, and Section IV shows the results obtained.
    [Show full text]
  • VARIANTIM Bulletin of the Israel Chess Composition Society
    VARIANTIM Bulletin of The Israel Chess Composition Society P.O. Box 637 Petach-Tikva 49106 Israel www.variantim.org No. 58 - December 2012 Editors Paz Einat, 45a Moshe Levi St., Nes Ziona 74207 [email protected] Shaul Shamir, 3 Dror St., Rishon Lezion 75305 [email protected] Ofer Comay, 213 Bney Efrayim St., Tel Aviv 69984 [email protected] Original problems Regular: Evgeny Bourd, Haazmaut 55/15, Ashdod 77452 [email protected] Fairy: Michael Grushko, P.O.Box 363, Kiryat Beyalik 27019 [email protected] Studies: Ofer Comay [email protected] In this issue: Pat aidé super-complet - Kummer 2-3 Israeli Successes Abroad - Navon 11-12 Philip Stamma and the Modern Study – Costeff 3-5 Originals 13-17 Working out an old Rukhlis mechanism – Einat 5-6 Selected Problems – Bourd 18-19 IRT - Threemovers 2009-11- Kuhlmann 7-8 Haymann 80 Birthday meeting 19 Storisteanu corrections 8 Israeli successes in Kobe 20-21 IRT - Fairies 2011- Gordian 9-10 Kobe Congress report – Einat 22 Ettinger 90 Memorial Tourney announcement 10 Editorial 23 1/4 Solving Championship 2013 23 Menachem Witztum & Mark Erenburg, our new International Master and FIDE Master 1 Pat aidé super-complet Eckart Kummer, Berlin (Germany) (Translated & shortened version of an article first published in Die Schwalbe, August 2012) Variantim readers will probably have heard of those feats which in 1964 the French problemist Romeo Bédoni proposed labelling aidé complet. In addition to the "normal" solution there have to be (in a helpmate or helpstalemate in 2) three tries which fail for lack of a tempo at B1, B2 and W1 respectively.
    [Show full text]
  • Lasker's Manual of Chess
    Lasker’s Manual of Chess by Emanuel Lasker Foreword by Mark Dvoretsky 2008 Russell Enterprises, Inc. Milford, CT USA 3 Lasker’s Manual of Chess © Copyright 2008 Russell Enterprises, Inc. All Rights Reserved. No part of this book may be used, reproduced, stored in a retrieval system or transmitted in any manner or form whatsoever or by any means, electronic, electrostatic, magnetic tape, photocopying, recording or otherwise, without the express written permission from the publisher except in the case of brief quotations embodied in critical articles or reviews. ISBN: 978-1-888690-50-7 Published by: Russell Enterprises, Inc. PO Box 5460 Milford, CT 06460 USA http://www.chesscafe.com [email protected] Cover design by Zygmunt Nasiolkowski and Janel Lowrance Editing and Proofreading: Taylor Kingston, David Kaufmann, Hanon Russell Production: Mark Donlan Printed in the United States of America 4 Table of Contents Foreword 14 Editor’s Preface 16 Dr. Lasker’s Tournament Record 18 Dr. Lasker’s Match Record 19 Preface to the Original German Edition 20 Book I: The Elements of Chess 21 Book II: The Theory of the Openings 50 Book III. The Combination 102 Book IV: Position Play 140 Book V: The Aesthetic Effect in Chess 199 Book VI: Examples and Models 216 Final Reflections 247 Analytical Endnotes 250 Index of Players 275 Index of Openings 277 Analytical Contents First Book The Elements of Chess 21 Brief Account of the Origin of the Game 21 The Chess Board 21 The Pieces 23 The Rules for Moving: a. the King 23 b. the Rook 23 c.
    [Show full text]