Chess Rules Research Articles

A Versatile Image Encryption Scheme Based on Optical Hologram Technology and Chess Rules

A novel versatile image encryption scheme about hologram technology and chess rules is proposed in this paper. This scheme can encrypt images by transferring them from the spatial domain to the frequency domain. First, the theory of computer-generated holograms is applied to record phase and amplitude features by imitating the optical hologram. The original image is transformed to a hologram and the phase values of the points in the image are recorded. Second, the parameters associated with the plaintext image are obtained by a Hash function and used as the initial values of the chaotic system, and then the pawns on the board are regarded as pixel points of the image, where the movement direction of the pawns is the movement direction of the pixel points of the image. The hologram is confused by combining the pawns’ movement rules with the chaotic sequences. Finally, the encrypted image is gained through a combination of the chaotic sequence and the selective diffusion method. The test results show that the scheme is able to resist various attacks and has good security performance in encryption.

Maldivian Chess (Raazuvaa)

Abstract Traditional Maldivian chess rules are presented and their similarity to pre-19th century Turkish chess is discussed, with musings on the potential role of Ottomans in spreading the “new game” invented in Europe – but played in their own manner – throughout the Muslim world and beyond.

2019 Okulöncesi Satranç Öğretim Programının Satranç Antrenörlerinin, Okulöncesi Öğretmenlerinin, Alan Uzmanlarının Görüşleri Doğrultusunda İncelenmesi

Okulöncesi dönemde çocukların öğrenme hızları en üst düzeydedir. Bu dönemde fiziksel ve zihinsel oyunlar, çocukların gelişimi için çok önemlidir. Çocukların gelişimine önemli katkısı olan zihinsel oyunlardan biri de satrançtır. Satranç eğitiminin çocukların gelişimindeki önemli katkıları, bazı toplumların satrancı programlarına ders olarak eklemelerine olanak sağlamıştır. Bu çalışma, okulöncesi döneme yönelik 2019 yılında yayımlanan Okulöncesi Satranç Öğretim Programını değerlendirmeye yönelik satranç antrenörlerinin, okulöncesi öğretmenlerinin ve okulöncesi eğitim alan uzmanlarının görüşlerini ortaya koymaktadır. Bu araştırma temel nitel araştırma modelinde desenlenmiştir. Çalışmanın katılımcılarını satranç antrenörleri, okulöncesi öğretmenleri ve okulöncesi eğitim alan uzmanları olmak üzere 115 kişi oluşturmaktadır. Çalışmanın verileri yarı yapılandırılmış görüşmeler yoluyla toplanmıştır. Görüşme verilerinin analizinde betimsel analiz yöntemi kullanılmıştır. Veriler analiz edildikten sonra bulgular ifade edilmiştir. Araştırma da elde edilen bulgulara göre katılımcıların çoğunun Satranç Öğretim Programının özel amaçlarının, okulöncesi eğitimin genel amaçlarına uygun olduğunu belirttikleri sonucuna ulaşılmıştır. Katılımcıların geneli, programı uygulamayı düşündüklerini ifade etmişlerdir. Programın çocuklara satranç kurallarını öğretme konusunda yeterli olduğu ifade edilmiştir. Katılımcıların çoğunun, programda belirlenen konu ve kazanımların çocukların düzeylerine uygun olduğunu belirttikleri sonucuna ulaşılmıştır. Bazı katılımcılar ise programın ayrıntıları üzerinde çalışılıp düzenlenmesi gerektiğini belirtmiştir. Katılımcıların çoğunun programı uygulama sürecinde karşılaşılabilecek sorunların çocuklara yönelik olduğu, bir kısmının ise öğretmen ya da programdan kaynaklı sorunlar olabileceğini belirttikleri sonucuna ulaşılmıştır.

Implementation of the Firefly Algorithm in the Case of N-Queens Problem

N-Queen problem is a form of puzzle game that uses chess rules for the queen on the standard chessboard with modified size. The challenge of the n-queen problem is finding the N ( N is positive integer) queens position on the chessboard, so that no queen can attack another queen on the board in a single move. Implementation of firefly algorithm in n-queens problem in this study aims to find n-queen problem solutions and count the number of iterations to achieve the optimal solution of each queen which will then be compared with the results of Sarkar and Nag's research (2017). This study uses an experimental method with a number of N between 10 to 20 and uses a population of 15 and 1000 firefly. The results showed that the firefly algorithm is able to find all the optimal solutions for the queen's position on a chessboard with dimensions 10 to 20 in a population of 1000 firefly. The firefly algorithm can find the optimal solution fewer iterations compared to the genetic algorithm. According to the experiment, firefly algorithm shows better performance in finding the optimal solution compared to genetic algorithm.

The Internet Changed Chess Rules: Queen Is Equal to Pawn. How Social Media Influence Opinion Spreading

Studies of social influence in large groups show that leaders are crucial in infecting followers with new ideas and that it requires time. This reflects social impact models based on Nowak, Szamrej, and Latané’s dynamic theory (1990), which are still being presented, modified and developed in the literature. However, recent mass events, e.g., the Arab Spring, 15-M Movement, protests in the Gezi Park in Turkey, Polish democratic movements (KOD, AkcjaDemokracja), do not seem to fit the aforementioned models: changes happened rapidly and without the presence of opinion leaders. In a series of simulation studies, we propose that global communication (Internet, mobiles, social media) is responsible for the difference between the theoretical model and recent mass events. Our results indicate that global communication dramatically decreases the role of leaders, increases the speed of spreading new ideas in the population, increases the influence of followers on the speed of social transformation, and that leaders who use the Internet can change their attitudes as quickly and as often as followers do.

Рэймонд Смаллиан и шахматный ретроанализ: философская перспектива

The article deals with the logico-epistemological and philosophical aspects of the creative work of Raymond Smullyan as a chess composer. He is well known as the author of many problems from the field of the so-called retroanalysis, which is an excellent field for constructing not only puzzles ideologically close to the classical problems of knights and knave, but also more serious, theoretically loaded cases. In the paper, three examples of such modeling are analyzed in detail. In particular, it turns out that the intuitionistic principle of constructive proof (also associated with the Smullyan's "paradox of inconsistency") on the chess material and the dispute between the nominalists and realists. Of particular interest is the "problem of the returned rook", where the question of the criteria for the identity of objects is raised with the utmost urgency in the language of retroanalysis (here, too, the connection with the well-known "Theseus's paradox" is evident), on the notion of essential and non-essential changes. It should be noted that Smullyan himself is clearly incomplete, his detailed specification is given, as well as an assessment from the point of view of not only the letter, but also the spirit of chess rules (which the author claims to reconstruct in this aspect). Particular attention is paid to the problem of accuracy, unambiguity and completeness of the chess rule of castling (as well as the definition of the term "move"), which plays a major role in this case. This case is also regarded as an excellent tool for training argumentative skills. Thus, retroanalysis and philosophy enrich each other, allow us to look at them from an unexpected side. The article underscores the undoubted importance of this relationship for the popularization of science in particular and intellectual culture in general.

The Comparison of the Traditional Boardgames and Their Improvement scheme - Focused on Chinese Chess Game

Traditional Chinese Boardgame as the Chinese national traditional culture has experienced thousands of years. But the rules of the game did not change. Since today, the game mainly concentrated in the old age. In recent years also born some Chinese chess improvement scheme, they changed chessboard shape, the user number, chess rules and so on, but did not pop up. This paper is the development of the Chinese chess, improvement plan to do a survey, and with the game interesting elements as the center is analyzed.

A PROGRAM TO PLAY KRIEGSPIEL

The game of Kriegspiel is a variant of the game of Chess. Kriegspiel is interesting because most chess rules are still valid, but gameplay is characterized by incomplete information as players may not see their opponent’s pieces and can only try to g

Group graphs and computational symmetry on massively parallel architecture

Efficient space and time exploitation of symmetry in domains on highly parallel, distributed-memory architecture is, in certain cases, equivalent to routing along a labeled group action graph, with computation associated with each group element label, where the group of symmetries acts on the processors. The algebraic structure of the group can sometimes be analyzed to determine, a priori, space and time efficient routing schedules on the hardware network (which, in practice, is often another group action graph). The algorithms we develop were implemented on a 64K-processor CM-2 and used to solve certain natural classes of chess endgames, part of whose search space is invariant under a noncommutative crystallographic group. This program runs 400 times faster than any previous implementation, and discovered many interesting new results in the area; some of these results are not solvable in practice with current serial techniques because the time and space requirements are too large. It seems interesting that it was possible, albeit with difficulty, to implement efficiently certain irregular chess rules on the CM-2, which is optimized for regular data sets.