Progress in Machines and Systems

DLINE Journals portal

Home

New Journals

Browse Journals

Journal Prices

For Authors

Print ISSN:
Online ISSN:

About JIO
	DLINE Portal Home Home Aims & Scope Editorial Board Current Issue Next Issue Previous Issue Sample Issue Upcoming Conferences Self-archiving policy Alert Services Be a Reviewer Publisher Paper Submission Subscription Contact us

How To Order
	Order Online Price Information Request for Complimentary Print Copy

For Authors
	Guidelines for Contributors Online Submission Call for Papers Author Rights

RELATED JOURNALS

Journal of Digital Information Management (JDIM)

Journal of Multimedia Processing and Technologies (JMPT)

International Journal of Web Application (IJWA)

Progress in Machines and Systems

Deterministic Algorithms for Solving Coding Theory Issues

Stojanche Panov1 and Saso Koceski2
Faculty of Computer Science at Ã¢â‚¬ËœGoce DelchevÃ¢â‚¬â„¢ University - Stip blvd. Krste Misirkov bb., 2000 Stip, R. Macedonia

Abstract: Using the reducing domain algorithms, we have studied the differences and issues in the available approaches to solve puzzles and have come out with a new deterministic approach for arriving at good solutions. Whereas other algorithms are available, we in this paper have provided a new kind of solution to this problem and found more acceptable results. We are confident that to solve the coding theory issues, this kind of development of effective deterministic algorithms.

Keywords: Backtracking Algorithms, Coding Theory, Deterministic Algorithms, Kakuro Puzzles Deterministic Algorithms for Solving Coding Theory Issues

DOI:https://doi.org/10.6025/pms/2022/11/2/27-33

Full_Text PDF 2.27 MB Download: 87 times

References:

[1] Simonis, H. (2008) Kakuro as a constraint problem. Proceedings of the Seventh Int. Works. on Constraint Modelling and Reformulation.
[2] Seta & T.A.K.A.H.I. R.O. ‘The Complexity of CROSS SUM.’ IPSJ SIG Notes, AL-84 (2002), 51–58.
[3] Ruepp, O. & Holzer, M. The computational complexity of the KAKURO puzzle, revisited. Fun with Algorithms. Springer: Berlin, Heidelberg (2010).
[4] Achterberg, T., Koch, T. & Martin, A. (2006) MIPLIB 2003. Operations Research Letters, 34, 361–372.
[5] Eén, N. & Sörensson, N. (2004) An extensible SAT-solver. Lecture Notes in Computer Science. Springer: Berlin, Heidelberg, 502–518.
[6] Davies, R.P., Roach, P.A. & Perkins, S. (2009) Automation of the solution of kakuro puzzles. Research and Development in Intelligent Systems, XXV, 219–232.
[7] Davies, R.P. (2009). An Investigation into the Solution to, and Evaluation of, Kakuro Puzzles. [Masters Phil Thesis]. University of Glamorgan.
[8] Cazenave, T. (2010) Monte-Carlo kakuro. Lecture Notes in Computer Science, 45–54.

DLINE Journals portal