Solve the Problem of Chess Board in the Shape of the Letter L with Three different Patterns Using Artificial Intelligence & Algorithms

To read the full-text of this research, you can request a copy directly from the authors.


In recent years, the chess game has begun to develop successful programming solutions. Computers were programmed to play chess in the middle of the twentieth century. Computer skills have become better and higher than the skills of chess players in the world, and from here this study has made it possible to find the optimal solution for the four square pieces in the form of a letter (L) without repetition and quick access to fill the sites and voids and to complete the entire area. It is our task to cover a (2n×2n) Chessboard with L-shaped tiles each tile is a (2×2) square with a (1×1) square removed from one corner. We are working to cover the Chessboard in such a way that there is a single 1×1 box left in the ‘corner’ of the Chessboard (by the 'corner' we mean one corner of the box should be uncovered). In this task, we will solve this problem with three approaches, the C programming approach, the second by dividing and conquering approach and the last by a greedy method approach. Three algorithms were used and a comparison was made between them, and the fastest method was achieved by a greedy method, with eight cases comparing one and four cases, respectively.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Full-text available
Abstract MapReduce is used within the Hadoop framework, which handles two important tasks: mapping and reducing. Data clustering in mappers and reducers can decrease the execution time, as similar data can be assigned to the same reducer with one key. Our proposed method decreases the overall execution time by clustering and lowering the number of reducers. Our proposed algorithm is composed of five phases. In the first phase, data are stored in the Hadoop structure. In the second phase, we cluster data using the MR-DBSCAN-KD method in order to determine all of the outliers and clusters. Then, the outliers are assigned to the existing clusters using the futuristic greedy method. At the end of the second phase, similar clusters are merged together. In the third phase, clusters are assigned to the reducers. Note that fewer reducers are required for this task by applying approximated load balancing between the reducers. In the fourth phase, the reducers execute their jobs in each cluster. Eventually, in the final phase, reducers return the output. Decreasing the number of reducers and revising the clustering helped reducers to perform their jobs almost simultaneously. Our research results indicate that the proposed algorithm improves the execution time by about 3.9% less than the fastest algorithm in our experiments.
Full-text available
Bayesian networks are a popular diagnosis method, whose structures are usually defined by human experts and parameters are learned from data. For the increasing complexity of modern systems, building their structures based on physical behaviors is becoming a difficult task. However, the improvement of data collection techniques motivates learning their structures from data, where greedy search is a typical iterative method. In each iteration, it generates multiple structure candidates by modifying one edge, evaluates these structures by scores based on data and selects the best structure for the next iteration. This method is costly because there are too many structures to be evaluated. To solve this problem, we frame the traditional greedy search by Markov decision process and propose an efficient Bayesian network learning approach by integrating reinforcement learning into it. In our approach, a convolutional neural network is employed as the value function to approximate scores. Before evaluating structures using data, the neural network is used to predict scores. Structure candidates with a low predicted score are discarded. By avoiding unnecessary computation, the cooperation of reinforcement learning and greedy search effectively improves the learning efficiency. Two systems, a 10-tank system with 21 monitored variables and the classic Tennessee Eastman process with 52 variables, are employed to demonstrate our approach. The experiment results indicate that the computation cost of our method was reduced by 30%∼50%, and the diagnosis accuracy was almost the same.
Full-text available
In this paper, the job shop scheduling problem (JSP) with a makespan minimization criterion is investigated. Various approximate algorithms exist that can solve moderate JSP instances within a reasonable time limit. However, only a few exact algorithms are known in the literature. We have developed an exact algorithm by means of a bounded dynamic programming (BDP) approach. This approach combines elements of a dynamic programming with elements of a branch and bound method. In addition, a generalization is investigated: the JSP with sequence dependent setup times (SDST-JSP). The BDP algorithm is adapted for this problem. To the best of our knowledge, the dynamic programming approach has never been applied to the SDST-JSP before. The BDP algorithm can directly be used as a heuristic. Computational results show that the proposed algorithm can solve benchmark instances up to 20 jobs and 15 machines for the JSP. For the SDST-JSP, the proposed algorithm outperforms all the state-of-the-art exact algorithms and the best-known lower bounds are improved for 5 benchmark instances.
Full-text available
Background/Objectives: Privacy preservation in data mining to hold back the sensitive data from attackers. Findings: There are various existing methods available to preserve the data like perturbation, anonymization, randomization etc., each method has its own advantages and disadvantages. The trade-off between security and utility of data should be handled with standardizing methods for the PPDM. In this paper explained a method based on PPDM in data mining using cluster based greedy method. Application/Improvements: This method can be applied in sensitive data areas such as hospitals, Customer Management System, government survey, etc., where there is need for privacy preservation.
In this paper, implementation of stream cipher algorithm based on nonlinear combination generator for any given sequences is introduced. The main contribution of this work is to enhance the security of this generator and level of complexity is added using logic functions. The proposed scheme was measured through a series of randomness tests.
With the increasing penetration of renewable energy sources and electric vehicles (EVs), coordinated operation of EV aggregator (EVA) and distribution system operation (DSO) becomes a complex multistage and multidimensional stochastic problem. The motivation behind this paper is to develop a decentralized mechanism to offer a computationally efficient and almost optimal on-line policy for such problem under the framework of transactive energy control (TEC). First, a heterogeneous decomposition-based TEC is designed by utilizing the heterogeneous interactions between DSO and EVA. Then, a decentralized approximate dynamic programming-based algorithm is proposed to offer almost optimal dynamic TEC policies. A decentralized value function approximation approach with temporal difference learning is further employed for entities to learn how to utilize the flexibilities of their resources in response to the stochastic exogenous information. Case studies demonstrate the effectiveness of the proposed algorithm in terms of optimality, robustness, computation efficiency, and scalability.
This paper discusses greedy methods for sensor placement in linear inverse problems. We comprehensively review the greedy methods in the sense of optimizing the mean squared error (MSE), the volume of the confidence ellipsoid (VCE), and the worst case error variance (WCEV). We show that the greedy method of optimizing an MSE related cost function can find a near-optimal solution. We then provide a new fast algorithm to optimize the MSE. In greedy methods, we select the sensing location one-by-one. In this way, the searching space is greatly reduced but many valid solutions are ignored. To further improve the current greedy methods, we propose a group greedy strategy, which can be applied to optimize all the three criteria. In each step, we reserve a group of suboptimal sensor configurations which are used to generate the potential sensor configurations of the next step and the best one is used to check the terminal condition. Compared with the current greedy methods, the group greedy strategy increases the searching space but greatly improve the solution performance. We find the necessary and sufficient conditions that the current greedy methods and the proposed group greedy method can obtain the optimal solution. The illustrative examples show that the group greedy method outperforms the corresponding greedy method. We also provide a practical way to find a proper group size with which the proposed group greedy method can find a solution that has almost the same performance as the optimal solution.
Recognising places under extreme perceptual changes is a challenging problem. A new dynamic programming method to align sequences of image features extracted from a deep convolutional auto-encoder to efficiently solve this problem is proposed. As this method considers not only environmental variations, but also the motion constraint of the mobile robot, places from changing environment can be successfully recognised by finding the most likely path sequence. Experimental results show improved precision-recall performance compared with other algorithms.
Conference Paper
In data mining applications, data instances are typically described by a huge number of features. Most of these features are irrelevant or redundant, which negatively affects the efficiency and effectiveness of different learning algorithms. The selection of relevant features is a crucial task which can be used to allow a better understanding of data or improve the performance of other learning tasks. Although the selection of relevant features has been extensively studied in supervised learning, feature selection with the absence of class labels is still a challenging task. This paper proposes a novel method for unsupervised feature selection, which efficiently selects features in a greedy manner. The paper first defines an effective criterion for unsupervised feature selection which measures the reconstruction error of the data matrix based on the selected subset of features. The paper then presents a novel algorithm for greedily minimizing the reconstruction error based on the features selected so far. The greedy algorithm is based on an efficient recursive formula for calculating the reconstruction error. Experiments on real data sets demonstrate the effectiveness of the proposed algorithm in comparison to the state-of-the-art methods for unsupervised feature selection.
Though the divide-and-conquer algorithm is a powerful technology, but it is difficult to be used in practice, so the design of this algorithm should be regulated in the teaching. In this article, the teaching process and the characters of the divide-and-conquer algorithm are studied when solving the problem of chessboard coverage. Aiming at the deficiency that the existing teaching method uses skills in decomposing sub-problems and increases the teaching difficulty, the coverage sequence of L-type dominoes is improved. The improved algorithm can keep consistent with the divide-and conquer strategy and standardize the iterative process, and increase the normative character and the consistence of the algorithm, and hence achieve ideal teaching result.
Dynamic Programming Approach for Drone Routes Planning
  • H Gjorshevski
  • K Trivodaliev
  • I N Kosovic
  • S Kalajdziski
  • B R Stojkoska
Gjorshevski, H., Trivodaliev, K., Kosovic, I.N., Kalajdziski, S., & Stojkoska, B.R. (2018). Dynamic Programming Approach for Drone Routes Planning. In 26 th Telecommunications Forum (TELFOR), 1-4.
Digital Image Enhancement Gray Scale Images in Frequency Domain
  • I M Hayder
  • H A Younis
  • H A K Younis
Hayder, I.M., Younis, H.A., & Younis, H.A.K. (2019). Digital Image Enhancement Gray Scale Images in Frequency Domain. In Journal of Physics: Conference Series, 1279(1).
Principles of Algorithmic Problem Solving
  • J Sannemo
Sannemo, J. (2018). Principles of Algorithmic Problem Solving. Draft version.