Automated Puzzle Solver Using Image Processing

Total Page:16

File Type:pdf, Size:1020Kb

Automated Puzzle Solver Using Image Processing AUTOMATED PUZZLE SOLVER USING IMAGE PROCESSING Project report submitted in fulfillment of the requirement for the degree of Bachelor of Technology In Computer Science and Engineering By Himanshu Malhotra (131219) Hitesh Jain (131224) Under the supervision of Dr. Pradeep Kumar Gupta To Department of Computer Science & Engineering and Information Technology Jaypee University of Information Technology Waknaghat, Solan-173234, Himachal Pradesh CERTIFICATE Candidates’ Declaration We hereby declare that the work presented in this report entitled “Automated Puzzle Solver Using Image Processing” in fulfillment of the requirements for the award of the degree of Bachelor of Technology in Computer Science and Engineering submitted in the department of Computer Science and Engineering, Jaypee University of Information Technology, Waknaghat is a genuine record of our own work carried out over a period from August 2016 to May 2017 under the supervision of Dr. Pradeep Kumar Gupta, Assistant Professor (Senior Grade) in Computer Science and Engineering department. The matter embodied in the report has not been submitted for the award of any other degree or diploma. Himanshu Malhotra (131219) Hitesh Jain (131224) This is to certify that the above statements made by the candidates are true to the best of my knowledge. Supervisor Name: Dr. Pradeep Kumar Gupta Designation: Assistant Professor (Senior Grade) Department name: Computer Science and Engineering Dated: i ACKNOWLEDGEMENT It gives us immense pleasure to present our knowledge-rich project, thanks for the continuous and patronage of people whose ceaseless cooperation made it possible, whose constant guidance and encouragement crown all efforts with success. We are grateful to our project guide Dr. Pradeep Kumar Gupta who made the way for us to move ahead through his suggestions and knowledge. We also thank our friends who have helped us in successful completion of the project. Date: Himanshu Malhotra (131219) Hitesh Jain (131224) ii TABLE OF CONTENTS S. No. Topic Page no. 1. Introduction 1 2. Literature Survey 5 3. System Development 31 4. Performance Analysis 42 5. Conclusion 49 iii LIST OF ABBREVIATIONS Abbreviation Word OCR Optical Character Recognition PNG Portable Network Graphics JPEG Joint Photographic Experts Group GIF Graphics Interchange Format DLX Dancing Links Algorithm iv LIST OF FIGURES S. No. Title Page No. 1. Example of Sudoku puzzle 1 2. System Architecture 31 3. Original image of Sudoku 32 4. Gray Scale Image of Sudoku 32 5. After applying Gaussian Blur and Adaptive Thresholding 33 6. Extracted Grid 34 7. Architecture of tesseract 36 8. Architecture of tesseract 36 9. Input image 37 10. Recognized digits output in notepad 38 11. Solution using backtracking 39 12. DFD Level 0 40 13. DFD Level 1 40 14. DFD Level 2 41 15. Memory taken by different algorithms 44 16. Time taken by Backtracking Algorithm 44 17. Time taken by Dancing Links 45 18. Sudoku Puzzle 45 19. Gray Scale 46 20. Gaussian Blur 46 21. Adaptive Thresholding 47 22. Extracting Grid 47 23. Thresholding the grid again 48 24. Extracting numbers and writing solution 48 v ABSTRACT In our project we proposed a method of detecting and recognizing the elements of a Sudoku Puzzle and providing a digital copy of the solution for it. The method involves a vision-based Sudoku solver. The solver is capable of solving a Sudoku directly from an image captured from any digital camera. After applying appropriate pre-processing to the acquired image we use efficient area calculation techniques to recognize the enclosing box of the puzzle. A virtual grid is then created to identify the digit positions. Tesseract OCR (Optical Character Recognition) engine is used as a method for digit recognition. The actual solution is computed using a backtracking algorithm. Experiments conducted on various types of Sudoku questions demonstrate the efficiency and robustness of our proposed approaches in real-world scenarios. The algorithm is found to be capable of handling cases of translation, perspective, illumination gradient, scaling, and background clutter. vi Chapter – 1 INTRODUCTION 1.1 Introduction In real life, we run over Sudoku riddles of fluctuating trouble levels in daily papers and magazines. It is a typical relaxation action for many people. Be that as it may, it is watched that the arrangement and the solution is not generally promptly accessible for the user’s verification. By and large, individuals need to hold up the Sudoku puzzle till the following day to check the arrangements of the Sudoku. Henceforth our inspiration for this project was to build up an application on an android gadget for this reason. In our application, the client needs to catch a perfect picture of an unsolved Sudoku Puzzle, which then returns the total arrangement of the same. Figure 1.1: Example of Sudoku puzzle Sudoku is a justification based game with the target to complete a 9x9 cross section so that each line, each portion and each of the nine 3x3 boxes contain the numbers 1 through 9 with a unique number. The issue itself is a pervasive brainteaser yet can without a doubt be used as an algorithmic task, with similarities to the graph shading issue just with settled size and 1 conditions. The present day type of Sudoku was introduced in Japan in the eighties and has starting now and into the foreseeable future pulled in an impressive measure of programming architects and thusly there are a considerable measure of different Sudoku fathoming counts open on the Internet. Sudoku solvers are captivating because they are sensible employments of incredibly speculative issues, and a large number individuals think about them. 1.2 Problem Statement The assignment is to tackle the Sudoku grid in as less time as possible. It should be possible by researching diverse methods for Sudoku solving and contrasting them for the most productive arrangement. Sudoku itself can be tackled utilizing brute-force approach in a sensible measure of time as a rule, yet there are extraordinary situations where it requires a long investment to the brute-force method. In this manner our idea is to attempt to discover efficient calculations for all examples of the issue and assess them while utilizing the ideal solver to get the answer for the Sudoku puzzle. There are two primary limitations that decide the productivity of an ideal solver. They are Time utilization and Memory utilization whose level of fulfilment decides the nature of an ideal Sudoku solver. These imperatives as a rule fluctuate from calculation to calculation. To understand the Sudoku puzzle in however much less time as could be expected. It should be possible by exploring distinctive strategies for understanding Sudoku and looking at them for the most productive arrangement. Along these lines our assignment is to attempt to discover effective calculations for all occasions of the issue and assess them while utilizing the ideal solver to get the answer for the Sudoku grid in as less time as possible and taking as less memory as possible. 1.3 Objective The goal of this project is to click a picture from a mobile phone and send it to the server via Wi-Fi and then using that image we will explain Sudoku with the utilization of recursive 2 backtracking algorithm while following the rules and then the generated Sudoku image needs to be transferred back in the mobile phone via Wi-Fi The Constraints are as per the following: Sudoku puzzle can just contain the numbers 1 through 9. A position requirement: Only 1 number can possess a cell, otherwise the output will be wrong and it is an unsolvable Sudoku A push imperative: Only 1 example of a number can be in the column A segment requirement: Only 1 occasion of a number can be in a section An area requirement: Only 1 occasion of a number can be in an area 1.4 Methodology The process to tackle the Sudoku depends on a recursive backtracking methodology. We store the numbers taken from the grid in the picture, in a two dimensional matrix with the number 0 allocated to clear areas which doesn’t have any digit associated to them. To get an answer for the Sudoku grid, we recognize a clear area in the matrix. In light of Sudoku principles, we recognize a very tough task by repeating through the numbers 1-9. We then attempt to recursively show the matrix with this new number position. In the event that there are no more grid areas which should be filled, it means that the network is unsolvable, and we give back the unsolved matrix back to the fundamental calculations. Then again, on the off chance that we neglect to recursively discover an answer for a matrix, we backtrack and attempt an alternate number task for an area and take a chance at settling the network once more. On the off chance that all number assignments (1 to 9) are exhausted without finding an answer, we finish up with the conclusion that the matrix is unsolvable and in this way the solver will return false. For our motivations anyway, we accept that the picture taken by the client is a Sudoku grid and our calculation will dependably explain it regardless of the trouble level of the puzzle. The strategy for illuminating the method is partitioned into: Capturing a picture of Sudoku utilizing camera Sending it to the server for processing via Wi-Fi 3 Smoothing the picture and pre-preparing methods Grid discovery Grid Extraction Recognition of digits utilizing OCR Using different calculations to get the answer for Sudoku Comparison between various calculations utilized for tackling Sudoku Environment setup for Android usage Building the required capacities and class layouts for the application Generate the desired image of solved Sudoku grid Send the image back to the mobile phone via Wi-Fi An android powered mobile phone and a Sudoku grid image is required for the whole process.
Recommended publications
  • Donald Knuth Fletcher Jones Professor of Computer Science, Emeritus Curriculum Vitae Available Online
    Donald Knuth Fletcher Jones Professor of Computer Science, Emeritus Curriculum Vitae available Online Bio BIO Donald Ervin Knuth is an American computer scientist, mathematician, and Professor Emeritus at Stanford University. He is the author of the multi-volume work The Art of Computer Programming and has been called the "father" of the analysis of algorithms. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces. As a writer and scholar,[4] Knuth created the WEB and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. As a member of the academic and scientific community, Knuth is strongly opposed to the policy of granting software patents. He has expressed his disagreement directly to the patent offices of the United States and Europe. (via Wikipedia) ACADEMIC APPOINTMENTS • Professor Emeritus, Computer Science HONORS AND AWARDS • Grace Murray Hopper Award, ACM (1971) • Member, American Academy of Arts and Sciences (1973) • Turing Award, ACM (1974) • Lester R Ford Award, Mathematical Association of America (1975) • Member, National Academy of Sciences (1975) 5 OF 44 PROFESSIONAL EDUCATION • PhD, California Institute of Technology , Mathematics (1963) PATENTS • Donald Knuth, Stephen N Schiller. "United States Patent 5,305,118 Methods of controlling dot size in digital half toning with multi-cell threshold arrays", Adobe Systems, Apr 19, 1994 • Donald Knuth, LeRoy R Guck, Lawrence G Hanson.
    [Show full text]
  • Solving Sudoku with Dancing Links
    Solving Sudoku with Dancing Links Rob Beezer [email protected] Department of Mathematics and Computer Science University of Puget Sound Tacoma, Washington USA Stellenbosch University October 8, 2010 Available at http://buzzard.pugetsound.edu/talks.html Example: Combinatorial Enumeration Create all permutations of the set f0; 1; 2; 3g Simple example to demonstrate key ideas Creation, cardinality, existence? There are more efficient methods for this example Rob Beezer (U Puget Sound) Solving Sudoku with Dancing Links Stellenbosch U October 2010 2 / 37 Brute Force Backtracking BLACK = Forward BLUE = Solution RED = Backtrack root 0 1 2 0 1 3 3 0 2 1 0 2 3 3 0 3 1 0 3 1 0 2 0 0 1 2 2 0 1 3 0 2 1 3 0 2 3 0 3 1 3 0 3 3 1 0 2 1 0 0 0 1 2 0 1 0 2 1 0 2 0 3 1 0 3 1 0 2 0 0 1 2 3 0 0 2 0 0 3 0 1 0 2 2 0 1 0 1 2 0 2 0 2 2 0 3 0 3 2 root 1 0 2 0 1 0 0 1 0 2 0 0 2 0 3 0 0 3 2 0 1 1 0 2 3 0 1 0 1 3 0 2 0 2 3 0 3 0 3 2 1 0 1 0 2 . 0 1 1 0 1 3 0 0 2 1 0 2 3 0 0 3 1 0 3 2 1 1 0 0 .
    [Show full text]
  • Posterboard Presentation
    Dancing Links and Sudoku A Java Sudoku Solver By: Jonathan Chu Adviser: Mr. Feinberg Algorithm by: Dr. Donald Knuth Sudoku Sudoku is a logic puzzle. On a 9x9 grid with 3x3 regions, the digits 1-9 must be placed in each cell such that every row, column, and region contains only one instance of the digit. Placing the numbers is simply an exercise of logic and patience. Here is an example of a puzzle and its solution: Images from web Nikoli Sudoku is exactly a subset of a more general set of problems called Exact Cover, which is described on the left. Dr. Donald Knuth’s Dancing Links Algorithm solves an Exact Cover situation. The Exact Cover problem can be extended to a variety of applications that need to fill constraints. Sudoku is one such special case of the Exact Cover problem. I created a Java program that implements Dancing Links to solve Sudoku puzzles. Exact Cover Exact Cover describes problems in h A B C D E F G which a mtrix of 0’s and 1’s are given. Is there a set of rows that contain exactly one 1 in each column? The matrix below is an example given by Dr. Knuth in his paper. Rows 1, 4, and 5 are a solution set. 0 0 1 0 1 1 0 1 0 0 1 0 0 1 0 1 1 0 0 1 0 1 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 1 1 0 1 We can represent the matrix with toriodal doubly-linked lists as shown above.
    [Show full text]
  • Covering Systems
    Covering Systems by Paul Robert Emanuel Bachelor of Science (Hons.), Bachelor of Commerce Macquarie University 2006 FACULTY OF SCIENCE This thesis is presented for the degree of Doctor of Philosophy Department of Mathematics 2011 This thesis entitled: Covering Systems written by Paul Robert Emanuel has been approved for the Department of Mathematics Dr. Gerry Myerson Prof. Paul Smith Date The final copy of this thesis has been examined by the signatories, and we find that both the content and the form meet acceptable presentation standards of scholarly work in the above mentioned discipline. Thesis directed by Senior Lecturer Dr. Gerry Myerson and Prof. Paul Smith. Statement of Candidate I certify that the work in this thesis entitled \Covering Systems" has not previously been submitted for a degree nor has it been submitted as part of requirements for a degree to any other university or institution other than Macquarie University. I also certify that the thesis is an original piece of research and it has been written by me. Any help and assistance that I have received in my research work and the prepa- ration of the thesis itself have been appropriately acknowledged. In addition, I certify that all information sources and literature used are indicated in the thesis. Paul Emanuel (40091686) March 2011 Summary Covering systems were introduced by Paul Erd}os[8] in 1950. A covering system is a collection of congruences of the form x ≡ ai(mod mi) whose union is the integers. These can then be specialised to being incongruent (that is, having distinct moduli), or disjoint, in which each integer satisfies exactly one congruence.
    [Show full text]
  • Visual Sudoku Solver
    Visual Sudoku Solver Nikolas Pilavakis MInf Project (Part 1) Report Master of Informatics School of Informatics University of Edinburgh 2020 3 Abstract In this report, the design, implementation and testing of a visual Sudoku solver app for android written in Kotlin is discussed. The produced app is capable of recog- nising a Sudoku puzzle using the phone’s camera and finding its solution(s) using a backtracking algorithm. To recognise the puzzle, multiple vision and machine learn- ing techniques were employed, using the OpenCV library. Techniques used include grayscaling, adaptive thresholding, Gaussian blur, contour edge detection and tem- plate matching. Digits are recognised using AutoML, giving promising results. The chosen methods are explained and compared to possible alternatives. Each component of the app is then evaluated separately, with a variety of methods. A very brief user evaluation was also conducted. Finally, the limitations of the implemented app are discussed and future improvements are proposed. 4 Acknowledgements I would like to express my sincere gratitude towards my supervisor, professor Nigel Topham for his continuous guidance and support throughout the academic year. I would also like to thank my family and friends for the constant motivation. Table of Contents 1 Introduction 7 2 Background 9 2.1 Sudoku Background . 9 2.2 Solving the Sudoku . 10 2.3 Sudoku recognition . 12 2.4 Image processing . 13 2.4.1 Grayscale . 13 2.4.2 Thresholding . 13 2.4.3 Gaussian blur . 14 3 Design 17 3.1 Design decisions . 17 3.1.1 Development environment . 17 3.1.2 Programming language . 17 3.1.3 Solving algorithm .
    [Show full text]
  • The Art of Computer Programming, Vol. 4A
    THE ART OF COMPUTER PROGRAMMING Missing pages from select printings of Knuth, The Art of Computer Programming, Volume 4A (ISBN-13: 9780201038040 / ISBN-10: 0201038048). Copyright © 2011 Pearson Education, Inc. All rights reserved. DONALD E. KNUTH Stanford University 6 77 ADDISON–WESLEY Missing pages from select printings of Knuth, The Art of Computer Programming, Volume 4A (ISBN-13: 9780201038040 / ISBN-10: 0201038048). Copyright © 2011 Pearson Education, Inc. All rights reserved. Volume 4A / Combinatorial Algorithms, Part 1 THE ART OF COMPUTER PROGRAMMING Boston · Columbus · Indianapolis · New York · San Francisco Amsterdam · Cape Town · Dubai · London · Madrid · Milan Munich · Paris · Montréal · Toronto · Mexico City · São Paulo Delhi · Sydney · Hong Kong · Seoul · Singapore · Taipei · Tokyo Missing pages from select printings of Knuth, The Art of Computer Programming, Volume 4A (ISBN-13: 9780201038040 / ISBN-10: 0201038048). Copyright © 2011 Pearson Education, Inc. All rights reserved. The poem on page 437 is quoted from The Golden Gate by Vikram Seth (New York: Random House, 1986), copyright ⃝c 1986 by Vikram Seth. The author and publisher have taken care in the preparation of this book, but make no expressed or implied warranty of any kind and assume no responsibility for errors or omissions. No liability is assumed for incidental or consequential damages in connection with or arising out of the use of the information or programs contained herein. The publisher offers excellent discounts on this book when ordered in quantity forbulk purposes or special sales, which may include electronic versions and/or custom covers and content particular to your business, training goals, marketing focus, and branding interests. For more information, please contact: U.S.
    [Show full text]
  • ACM Bytecast Don Knuth - Episode 2 Transcript
    ACM Bytecast Don Knuth - Episode 2 Transcript Rashmi: This is ACM Bytecast. The podcast series from the Association for Computing Machinery, the ​ ​ world's largest educational and scientific computing society. We talk to researchers, practitioners, and innovators who are at the intersection of computing research and practice. They share their experiences, the lessons they've learned, and their own visions for the future of computing. I am your host, Rashmi Mohan. Rashmi: If you've been a student of computer science in the last 50 years, chances are you are very familiar and somewhat in awe of our next guest.An author, a teacher, computer scientist, and a mentor, Donald Connote wears many hats. Don, welcome to ACM Bytecast. ​ ​ Don: Hi. Rashmi: I'd like to lead with a simple question that I ask all my guests. If you could please introduce yourself and talk about what you currently do and also give us some insight into what drew you into this field of work. Don: Okay. So I guess the main thing about me is that I'm 82 years old, so I'm a bit older than a lot of the other people you'll be interviewing. But even so, I was pretty young when computers first came out. I saw my first computer in 1956 when I was 18 years old. So although people think I'm an old timer, really, there were lots of other people way older than me. Now, as far as my career is concerned, I always wanted to be a teacher. When I was in first grade, I wanted to be a first grade teacher.
    [Show full text]
  • Performance and Scalability of Sudoku Solvers
    Performance and Scalability of Sudoku Solvers Prestanda och Skalbarhet för Sudoku Lösare VIKSTÉN, HENRIK NORRA STATIONSGATAN 99 STOCKHOLM 113 64 073 643 76 29 [email protected] MATTSSON, VIKTOR FURUSUNDSGATAN 10 STOCKHOLM 115 37 073 061 74 90 [email protected] Bachelor’s Thesis at NADA Supervisor: Mosavat, Vahid Examiner: Björkman, Mårten TRITA xxx yyyy-nn Abstract This paper aims to clarify the differences in algorithm de- sign with a goal of solving sudoku. A few algorithms were chosen suitable to the problem, yet different from one an- other. To take an everyday puzzle and utilize common com- puter science algorithms and learn more about them. Get relevant data to see how they perform in situations, how easily they can be modified and used in larger sudokus. Also how their performance scales when the puzzle grows larger. From the results Dancing links was the fastest and scaled best of the algorithms tested, while Brute-force and Simu- lated annealing struggled keeping consistent results. Referat Prestanda och Skalbarhet för Sudoku Lösare Detta dokument syftar till att klargöra skillnaderna i algo- ritmer med målet att lösa sudoku. Välja ett par olika algo- rithmer lämpliga för problemet, men som samtidigt skiljer sig från varandra. Att ta ett dagligt pussel och utnyttja van- ligt förekommande algoritmer inom datavetenskap och lära sig mer om dem. Få relevant data och se hur de presterar i olika situationer, hur lätt de kan modifieras och användas i större Sudokus. Även hur deras prestanda skalar när puss- let blir större. Dancing links var den snabbaste algoritmen och skalade bäst av de som testades.
    [Show full text]
  • Donald E. Knuth Papers SC0097
    http://oac.cdlib.org/findaid/ark:/13030/kt2k4035s1 Online items available Guide to the Donald E. Knuth Papers SC0097 Daniel Hartwig & Jenny Johnson Department of Special Collections and University Archives August 2018 Green Library 557 Escondido Mall Stanford 94305-6064 [email protected] URL: http://library.stanford.edu/spc Note This encoded finding aid is compliant with Stanford EAD Best Practice Guidelines, Version 1.0. Guide to the Donald E. Knuth SC00973411 1 Papers SC0097 Language of Material: English Contributing Institution: Department of Special Collections and University Archives Title: Donald E. Knuth papers Creator: Knuth, Donald Ervin, 1938- source: Knuth, Donald Ervin, 1938- Identifier/Call Number: SC0097 Identifier/Call Number: 3411 Physical Description: 39.25 Linear Feet Physical Description: 4.3 gigabyte(s)email files Date (inclusive): 1962-2018 Abstract: Papers reflect his work in the study and teaching of computer programming, computer systems for publishing, and mathematics. Included are correspondence, notes, manuscripts, computer printouts, logbooks, proofs, and galleys pertaining to the computer systems TeX, METAFONT, and Computer Modern; and to his books THE ART OF COMPUTER PROGRAMMING, COMPUTERS & TYPESETTING, CONCRETE MATHEMATICS, THE STANFORD GRAPHBASE, DIGITAL TYPOGRAPHY, SELECTED PAPERS ON ANALYSIS OF ALGORITHMS, MMIXWARE : A RISC COMPUTER FOR THE THIRD MILLENNIUM, and THINGS A COMPUTER SCIENTIST RARELY TALKS ABOUT. Special Collections and University Archives materials are stored offsite and must be paged 36-48 hours in advance. For more information on paging collections, see the department's website: http://library.stanford.edu/depts/spc/spc.html. Immediate Source of Acquisition note Gift of Donald Knuth, 1972, 1980, 1983, 1989, 1996, 1998, 2001, 2014, 2015, 2019.
    [Show full text]
  • The Art of Computer Programming, Vol. 4 Fascicle 6
    Computer Science/Programming/Algorithms The Art of Computer Programming New DONALD E. KNUTH This multivolume work on the analysis of algorithms has long been recognized as the definitive K description of classical computer science. The four volumes published to date already comprise a NUTH unique and invaluable resource in programming theory and practice. Countless readers have spoken NEWLY AVAILABLE SECTION OF about the profound personal influence of Knuth’s writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his “cookbook” THE CLASSIC WORK solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To continue the fourth and later volumes of the set, and to update parts of the existing volumes, Knuth has created a series of small books called fascicles, which are published at regular intervals. The Art of Computer Programming Each fascicle encompasses a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4 Fascicle 6 The Art of This fascicle, brimming with lively examples, forms the middle third of what will eventually become hardcover Volume 4B. It introduces and surveys “Satisfiability,’’ one of the most fundamental problems in all of computer science: Given a Boolean function, can its variables be set to at least one pattern of 0s and 1s that will make the function true? Satisfiability is far from an abstract exercise in understanding formal systems.
    [Show full text]
  • The Art of Computer Programming, Volume 4A David Walden Donald E. Knuth, T
    230 TUGboat, Volume 32 (2011), No. 2 An appreciation: The Art of Computer ters have been covered in depth by other books Programming, Volume 4A and as the topics covered by some of the chapters expanded dramatically (perhaps partially as a re- David Walden sult of Knuth's example of rigorous, comprehen- Donald E. Knuth, The Art of Computer sive books describing computer algorithms). To- Programming, Volume 4A: Combinatorial day Knuth hopes to produce five volumes, of which Algorithms, Part 1. Addison-Wesley, Boston. the current volume 4 will have at least three parts Jan. 2011. 912 pp. Hardcover, US$74.99. (books): http://www-cs-faculty.stanford.edu/ ISBN 0-201-03804-8. ~uno/taocp.html A book of algorithms relating to computer pro- Part 1 (that is, book 1) of Volume 4 (the overall gramming and their analysis (and about problem volume is on combinatorial algorithms) covers an solving more generally) would not normally be re- Introduction, Zeros and Ones (with four subsections) viewed in this journal about typesetting and fonts. and Generating All Possibilities (with one subsec- tion containing seven subsubsections). Curiously, However, TEX, TUG, and TUGboat would not exist without the problem Knuth faced in 1976 with the the second and third subsections on Generating All the typesetting of the second edition of Volume 2 of Possibilities are not due until Volume 4B. Perhaps at 912 pages (and after publication of the groups The Art of Computer Programming (TAOCP); and of pages from the book over the past half dozen or thus TAOCP is a key part of the history of the TEX world.
    [Show full text]
  • Generic Distributed Exact Cover Solver
    Generic Distributed Exact Cover Solver Jan Magne Tjensvold December 18, 2007 Abstract This report details the implementation of a distributed computing system which can be used to solve exact cover problems. This work is based on Donald E. Knuth’s recursive Dancing Links algorithm which is designed to efficiently solve exact cover problems. A variation of this algorithm is developed which enables the problems to be distributed to a global network of computers using the BOINC framework. The parallel nature of this distributed computing platform allows more complex problems to be solved. Exact cover problems includes, but is not limited to problems like n-queens, Latin Square puzzles, Sudoku, polyomino tiling, set packing and set partitioning. The details of the modified Dancing Links algorithm and the implementation is explained in detail. A Petri net model is developed to examine the flow of data in the distributed system by running a number of simulations. Acknowledgements I wish to thank Hein Meling for his detailed and insightful comments on the report and his helpful ideas on the design and implementation of the software. i Contents 1 Introduction 1 1.1 Queens . 1 1.2 Related work . 3 1.3 Report organization . 3 2 Dancing Links 4 2.1 Exact cover . 4 2.1.1 Generalized exact cover . 5 2.2 Algorithm X . 7 2.3 Dancing Links . 9 2.3.1 Data structure . 10 2.3.2 Algorithm . 11 2.4 Parallel Dancing Links . 12 3 Implementation details 15 3.1 Architecture . 15 3.2 Transforms . 16 3.2.1 n-queens .
    [Show full text]