• Title/Summary/Keyword: 숫자퍼즐

Search Result 11, Processing Time 0.02 seconds

A Study on the Effect of playing Number Puzzle to Develop Mathematical Creativity and Creative Attitude in Mathematics for 6th Grader (숫자퍼즐 활동이 초등학교 6학년 학생들의 수학적 창의성과 수학에서의 창의적 태도에 미치는 영향)

  • Baek, Tae Jin;Lee, Kwangho
    • Education of Primary School Mathematics
    • /
    • v.21 no.2
    • /
    • pp.93-109
    • /
    • 2018
  • The purpose of this study is to develop the number puzzle program and the mathematical creativity test and to analyze the effects of the mathematical creativity and the creative attitude in mathematics. To accomplish this aim, the six-grade students elementary school of thirty-six participated and this students participated Magic square, Sudoku, KenKen Puzzle activities in to the morning activity time for 30 minutes every morning and the pre-test of before activity and the post-test of after activity were collected. The number puzzle activity helps improve the mathematical creativity and the creative attitude in mathematics of the elementary school students and improve the mathematical creativity of for female students rather than for male students.

Algorithm for Cross-avoidance Bypass Routing in Numberlink Puzzle (숫자 연결 퍼즐에 관한 교차 회피 우회 경로 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.3
    • /
    • pp.95-101
    • /
    • 2024
  • The numberlink puzzle(NLP), which non-crossings with other numbers of connection in connecting lines through empty cells between a given pair of numbers, is an NP-complete problem with no known way to solve the puzzle in polynomial time. Until now, arbitrary numbers have been selected and puzzles have been solved using trial-and-error methods. This paper converts empty cells into vertices in lattice graphs connected by edge between adjacent cells for a given problem. Next, a straight line was drawn between the pairs of numbers and divided into groups of numbers where crossing occurred. A bypass route was established to avoid intersection in the cross-number group. Applying the proposed algorithm to 18 benchmarking data showed that the puzzle could be solved with a linear time complexity of O(n) for all data.

Algorithm for Candidate Clue Decision based on Magic Rule in Kakuro Puzzle (가꾸로 퍼즐에 관한 마법 규칙 기반 실마리 후보 결정 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.3
    • /
    • pp.103-108
    • /
    • 2024
  • Kakuro puzzles are NP-complete problems where no way to solve puzzles in polynomial time is known. Until now, a brute-force search method or a linear programming method has been applied to substitute all possible cases. This paper finds a magic rule, a rule for box sizes and unfilled numbers according to sum clues. Based on the magic rule, numbers that cannot enter empty cells were deleted from the box for row and column sum clues. Next, numbers that cannot enter the box were deleted based on the sum clue value. Finally, cells with only a single number were confirmed as clues. As a result of applying the proposed algorithm to seven benchmarking experimental data, it was shown that solutions could be obtained for all problems.

Orthogonal Sudoku Square Designs with Block Effect Discrimination (블럭효과를 구별할 수 있는 직교스도쿠방격법)

  • Jang, Dae-Heung
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.3
    • /
    • pp.505-513
    • /
    • 2011
  • Sudoku is a famous Latin-square-based number-placement puzzle. Mo and Xu (2008) proposed Sudoku square designs based on the idea of Sudoku. Using several Sudoku square designs which are mutually orthogonal, we can suggest the orthogonal Sudoku square designs with block effect discrimination.

A Recognition of the Printed Alphabet, the Number and the Symbols by Using Japanese Puzzle (Japanese Puzzle을 이용한 인쇄체 영문자, 숫자, 기호의 인식)

  • Sohn, Young-Sun;Kim, Bo-Sung
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.11a
    • /
    • pp.119-122
    • /
    • 2007
  • 지금까지의 연구에서 Japanese Puzzle을 이용한 인쇄체 영문자 인식을 구현하여 좋은 결과를 얻었고, 본 논문 에서는 인쇄체 영문자(바탕, 돋움) 인식을 확장시켜 영문장을 인식하기 위해 키보드에서 입력 가능한 숫자 및 기호를 포함하여 인식하는 시스템을 구현하였다. 이미지를 입력 받아 이진화 처리, 히스토그램 투영을 이용한 문자 분리는 영문자 인식에서와 동일한 처리를 한다. 기호 중에서 세로 길이보다 가로 길이가 긴 기호인 -,-,= 만 가로를 정규화 하였고, 나머지는 세로를 정규화 하였다. 정규화 된 문자에 Japanese Puzzle을 역으로 적용하여 구하여진 수치 정보로부터 영문자, 숫자, 기호를 분류 및 인식하여 좋은 결과를 얻었다.

  • PDF

Binary Backtracking Algorithm for Sudoku (스도쿠 퍼즐을 위한 이진역추적 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.4
    • /
    • pp.155-161
    • /
    • 2017
  • This paper suggests polynomial time solution algorithm for Sudoku puzzle problem. This problem has been known NP (non-deterministic polynomial time)-complete. The proposed algorithm set the initial value of blank cells to value range of [$1,2,{\cdots},9$]. Then the candidate set values in blank cells deleted by preassigned clue in row, column, and block. We apply the basic rules of Stuart, and proposes two additional rules. Finally we apply binary backtracking(BBT) technique. For the experimental Sudoku puzzle with various categories of solution, the BBT algorithm can be obtain all of given Sudoku puzzle regardless of any types of solution.

Optimized Encoding of Sudoku Puzzle for SAT Solvers (SAT 처리기를 위한 수도쿠 퍼즐의 최적화된 인코딩)

  • Kwon, Gi-Hwon
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.7
    • /
    • pp.616-624
    • /
    • 2007
  • Sudoku can be regarded as a SAT problem. Various encodings are known for encoding Sudoku as a Conjunctive Normal Form (CNF) formula, which is the standard input for most SAT solvers. Using these encodings for large Sudoku, however, generates too many clauses, which impede the performance of state-of-the-art SAT solvers. This paper presents an optimized CNF encodings of Sudoku to deal with large instances of the puzzle. We use fixed cells in Sudoku to remove redundant clauses during the encoding phase. This results in reducing the number of clauses and a significant speedup in the SAT solving time.

Puzzle Rule Algorithm of Euler Square Game (오일러 방진 게임 퍼즐 규칙 알고리즘)

  • Lee, Sang-Un
    • Journal of Industrial Convergence
    • /
    • v.19 no.4
    • /
    • pp.23-28
    • /
    • 2021
  • This paper finds the regular pattern of n = [3, ∞] for Euler square game related with n = 6(6×6=36) thirty-six officer problem that is still unsolved problem. The solution of this problem is exists for n = [3, 10] without n = 6. Also, previous researchers finds the random assigned solution for specific number using computer programming. Therefore, the solution of n = [11, ∞] Euler squares are unsolved problem because of anything but easy. This paper attempts to find generalized patterns for domains that have been extended to n = [3, ∞], while existing studies have been limited to n = [3, 10]. This paper classify the n = [3, ∞] into n = odd, 4k even, 4k+2 even of three classes. Then we find the simple regular pattern solution for n = odd and 4k even(n/2 = even). But we can't find the regular pattern for 4k+2 even(n/2 = odd).

Result Analysis on Making Activities 1 to 100 with digits 1, 9, 9, 6 (숫자 1, 9, 9, 6을 이용하여 1에서 100까지 만들기 과제 적용 결과 분석)

  • Kim, Sang-Lyong
    • Education of Primary School Mathematics
    • /
    • v.13 no.2
    • /
    • pp.55-66
    • /
    • 2010
  • The basic direction of mathematical education for the 21st century is focused on helping student to understand mathematics and developing their problem solving abilities, mathematical disposition and mathematical thinking. Elementary mathematics teachers should help students make sense of mathematics, confident of their ability, and make learning environment comfortable for students to participate in. Through making activities 1 to 100 with digits 1,9,9,6, students improved the interest and preference of students about mathematics. This game is useful to foster students' mathematical thinking(concepts of exponential number expression, roots concept(${\sqrt}$), gauss function([])) and mathematical disposition. If students are helped to be interested in mathematics through mathematical games, they regard mathematics as interesting and challengeable subject to let themselves think many ways.

Game-based Learning Content Development for Learning Principles of Finding Prime Numbers (소수를 찾는 원리 학습을 위한 게임 기반 학습 콘텐츠 개발)

  • Kim, Han-Tae;Hong, Myoung-Pyo;Choi, Yong-Suk
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06b
    • /
    • pp.272-275
    • /
    • 2011
  • 본 논문에서는 수학에서 사용하는 소수(Prime number)를 찾는 원리에 대한 학습을 위한 게임 기반 학습(Game based learning) 콘텐츠인 Prime Miner라는 게임을 제안한다. Prime Miner는 게임이 가지고 있는 장점과 소수의 원리를 결합하여 게임을 통해 학습자의 흥미를 이끌어 학습에 몰입할 수 있도록 도우며, 학습자가 게임 규칙을 통해 소수의 원리를 합리적으로 배울 수 있도록 유도한다. 본 논문에서는 Prime Miner의 게임 원리와 학습자가 Prime Miner를 통해 소수 학습을 하는 방법을 설명한다. 또한 퍼즐게임에서 종종 발생하는 더 이상 게임을 진행할 수 없는 상태인 교착상태(Deadlock)를 피하기 위한 숫자 타일의 배치에 관한 방법도 제시한다.