Relevant bibliographies by topics / Sliding Puzzle

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Sliding Puzzle'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Sliding Puzzle.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Sliding Puzzle"

1

Saurabh Chauhan and Shreya Kapoor. "Sliding Puzzle CAPTCHA Analysis." International Journal for Modern Trends in Science and Technology 6, no. 12 (December 5, 2020): 165–70. http://dx.doi.org/10.46501/ijmtst061232.

Full text
Abstract:
Today a number of everyday activities are done through the Internet. To perform such web services users must register in relation to websites or fill some form. In such websites, some hackers write malicious programs called bots that destroy website resources by creating fake registrations or form submissions. This false registration may adversely affect the performance of websites. Therefore, it is necessary to distinguish between actual human users and Web bots (or computer programs) via tests known as CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart). Most of the conventional CAPTCHA challenges have become an easy nut to crack for bots, hence calling a need for better CAPTCHA alternatives. This paper studies the infamous 'Sliding Puzzle' as an alternate CAPTCHA challenge and analysing the complexity to solve it via bot script.
APA, Harvard, Vancouver, ISO, and other styles
2

Lin, Ting-Yu, Shi-Chun Tsai, Wen-Nung Tsai, and Jong-Chuang Tsay. "More on the one-dimensional sliding-coin puzzle." Discrete Applied Mathematics 162 (January 2014): 32–41. http://dx.doi.org/10.1016/j.dam.2013.08.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shaban, Ruqaya, Isra Natheer Alkallak, and Mowada Mohamad Sulaiman. "Genetic Algorithm to Solve Sliding Tile 8-Puzzle Problem." JOURNAL OF EDUCATION AND SCIENCE 23, no. 3 (September 1, 2010): 145–57. http://dx.doi.org/10.33899/edusj.2010.58405.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

London, James, Juana Martín-López, Inho Yang, Jiaquan Liu, Jong-Bong Lee, and Richard Fishel. "Linker domain function predicts pathogenic MLH1 missense variants." Proceedings of the National Academy of Sciences 118, no. 9 (February 22, 2021): e2019215118. http://dx.doi.org/10.1073/pnas.2019215118.

Full text
Abstract:
The pathogenic consequences of 369 unique human HsMLH1 missense variants has been hampered by the lack of a detailed function in mismatch repair (MMR). Here single-molecule images show that HsMSH2-HsMSH6 provides a platform for HsMLH1-HsPMS2 to form a stable sliding clamp on mismatched DNA. The mechanics of sliding clamp progression solves a significant operational puzzle in MMR and provides explicit predictions for the distribution of clinically relevant HsMLH1 missense mutations.
APA, Harvard, Vancouver, ISO, and other styles
5

Finkelstein, L., and S. Markovitch. "A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle." Journal of Artificial Intelligence Research 8 (June 1, 1998): 223–63. http://dx.doi.org/10.1613/jair.484.

Full text
Abstract:
One of the most common mechanisms used for speeding up problem solvers is macro-learning. Macros are sequences of basic operators acquired during problem solving. Macros are used by the problem solver as if they were basic operators. The major problem that macro-learning presents is the vast number of macros that are available for acquisition. Macros increase the branching factor of the search space and can severely degrade problem-solving efficiency. To make macro learning useful, a program must be selective in acquiring and utilizing macros. This paper describes a general method for selective acquisition of macros. Solvable training problems are generated in increasing order of difficulty. The only macros acquired are those that take the problem solver out of a local minimum to a better state. The utility of the method is demonstrated in several domains, including the domain of NxN sliding-tile puzzles. After learning on small puzzles, the system is able to efficiently solve puzzles of any size.
APA, Harvard, Vancouver, ISO, and other styles
6

Ortega, Janice, Grace Sanghee Lee, Liya Gu, Wei Yang, and Guo-Min Li. "Mispair-bound human MutS–MutL complex triggers DNA incisions and activates mismatch repair." Cell Research 31, no. 5 (January 28, 2021): 542–53. http://dx.doi.org/10.1038/s41422-021-00468-y.

Full text
Abstract:
AbstractDNA mismatch repair (MMR) relies on MutS and MutL ATPases for mismatch recognition and strand-specific nuclease recruitment to remove mispaired bases in daughter strands. However, whether the MutS–MutL complex coordinates MMR by ATP-dependent sliding on DNA or protein–protein interactions between the mismatch and strand discrimination signal is ambiguous. Using functional MMR assays and systems preventing proteins from sliding, we show that sliding of human MutSα is required not for MMR initiation, but for final mismatch removal. MutSα recruits MutLα to form a mismatch-bound complex, which initiates MMR by nicking the daughter strand 5′ to the mismatch. Exonuclease 1 (Exo1) is then recruited to the nick and conducts 5′ → 3′ excision. ATP-dependent MutSα dissociation from the mismatch is necessary for Exo1 to remove the mispaired base when the excision reaches the mismatch. Therefore, our study has resolved a long-standing puzzle, and provided new insights into the mechanism of MMR initiation and mispair removal.
APA, Harvard, Vancouver, ISO, and other styles
7

SUSANTI, RIANA. "EFEKTIFITAS GAMIFIKASI SLIDING PUZZLE PADA PEMBELAJARAN E-LEARNING TERHADAP MOTIVASI DAN HASIL BELAJAR IPA." SPEKTRA: Jurnal Kajian Pendidikan Sains 7, no. 1 (April 28, 2021): 57. http://dx.doi.org/10.32699/spektra.v7i1.178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Riawang, Puguh, Mamika Ujianita Romdhini, and Irwansyah. "Perbandingan Algoritma A* (A star) dan Algoritma IDA* (Iterative Deepening A* Pada Permainan Sliding Puzzle." EIGEN MATHEMATICS JOURNAL 1, no. 2 (December 31, 2019): 118. http://dx.doi.org/10.29303/emj.v1i2.39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Felner, A., R. E. Korf, R. Meshulam, and R. C. Holte. "Compressed Pattern Databases." Journal of Artificial Intelligence Research 30 (October 12, 2007): 213–47. http://dx.doi.org/10.1613/jair.2241.

Full text
Abstract:
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct entry in the table for each subproblem instance. In this paper we investigate compressing PDBs by merging several entries into one, thereby allowing the use of PDBs that exceed available memory in their uncompressed form. We introduce a number of methods for determining which entries to merge and discuss their relative merits. These vary from domain-independent approaches that allow any set of entries in the PDB to be merged, to more intelligent methods that take into account the structure of the problem. The choice of the best compression method is based on domain-dependent attributes. We present experimental results on a number of combinatorial problems, including the four-peg Towers of Hanoi problem, the sliding-tile puzzles, and the Top-Spin puzzle. For the Towers of Hanoi, we show that the search time can be reduced by up to three orders of magnitude by using compressed PDBs compared to uncompressed PDBs of the same size. More modest improvements were observed for the other domains.
APA, Harvard, Vancouver, ISO, and other styles
10

Holmes, K. C., D. R. Trentham, R. Simmons, H. Lee Sweeney, and Anne Houdusse. "The motor mechanism of myosin V: insights for muscle contraction." Philosophical Transactions of the Royal Society of London. Series B: Biological Sciences 359, no. 1452 (December 29, 2004): 1829–42. http://dx.doi.org/10.1098/rstb.2004.1576.

Full text
Abstract:
It is 50 years since the sliding of actin and myosin filaments was proposed as the basis of force generation and shortening in striated muscle. Although this is now generally accepted, the detailed molecular mechanism of how myosin uses adenosine triphosphate to generate force during its cyclic interaction with actin is only now being unravelled. New insights have come from the unconventional myosins, especially myosin V. Myosin V is kinetically tuned to allow movement on actin filaments as a single molecule, which has led to new kinetic, mechanical and structural data that have filled in missing pieces of the actomyosin–chemo–mechanical transduction puzzle.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Sliding Puzzle"

1

Spaans, Ruben Grønning. "Improving sliding-block puzzle solving using meta-level reasoning." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10813.

Full text
Abstract:

In this thesis, we develop a meta-reasoning system based on CBR which solves sliding-block puzzles. The meta-reasoning system is built on top of a search-based sliding-block puzzle solving program which was developed as part of the specialization project at NTNU. As part of the thesis work, we study existing literature on automatic puzzle solving methods and state space search, as well as the use of reasoning and meta-level reasoning applied to puzzles and games. The literature study forms the theoretical foundation for the development of the meta-reasoning system. The meta-reasoning system is further enhanced by adding a meta-control cycle which uses randomized search to generate new cases to apply to puzzles. In addition, we explore several ways of improving the underlying solver program by trying to solve hard puzzles by using the solution for easier variants, and by developing a more memory-efficient way of representing puzzle configurations. We evaluate the results of our system, and shows that it offers a slight improvement compared to solving the puzzles with a set of general cases, as well as showing vast improvement for a few isolated test cases, but the performance is slightly behind the hand-tuned parameters we found in the specialization project. We conclude our work by identifying parts of our system where improvement can be done, as well as suggesting other promising areas for further research.

APA, Harvard, Vancouver, ISO, and other styles
2

Lin, Ting-Yu, and 林庭宇. "On the Complexity of the Linear Sliding-Coin Puzzle." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/96920020639531182613.

Full text
Abstract:
碩士
國立交通大學
資訊科學與工程研究所
98
Consider a line of n nickels and n pennies with all nickels arranged to the left of all pennies, where n >= 3. The puzzle asks the player to rearrange the coins such that nickels and pennies alternate in the line. In each move, the player is allowed to slide k >= 2 adjacent coins to a new position without rotating. We prove that it takes at least n moves to solve the puzzle, and present algorithms to generate the optimal solutions for k = 2 and k = 3. We also propose a framework to extend solutions, and apply it successfully to construct optimal solutions for k = 4 and k = 5.
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, Der Jenq, and 劉得正. "Development of Machine Learning Algorithm for Sliding Block Puzzle." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/24030971326816317294.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Michalík, Petr. "Sub-optimální algoritmy pro řešení úloh o přesouvání kamenů." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-295925.

Full text
Abstract:
Title: Sub-optimal algorithms for solving sliding puzzles Author: Petr Michalík Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: RNDr. Pavel Surynek, Ph.D. Supervisor's e-mail address: Pavel.Surynek@mff.cuni.cz In the present work techniques for solving the so-called sliding tiles puzzles, which generate optimal or sub-optimal solution, are studied. This thesis focuses especially on a specific variant of the puzzle: the (n^2-1)-puzzle. This work shows and compares current methods for solving this type of problem. A choosen method is a subject to a close analysis of complexity and is also implemented so that theoretical and experimental results could be confronted. An alternative sub-optimal algorithm is proposed and its theoretical analysis is presented. This algorithm is implemented as well and is compared with the existing algorithm. Both the theoretical analysis and the test results show that better (shorter) solutions can often be obtained using this alternative algorithm.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Sliding Puzzle"

1

Sliding piece puzzles. Oxford [Oxfordshire]: Oxford University Press, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ernő, Rubik, ed. Rubik's Cubic Compendium. Oxford: Oxford University Press, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Sliding Puzzle"

1

Dirgová Luptáková, Iveta, and Jiří Pospíchal. "Transition Graph Analysis of Sliding Tile Puzzle Heuristics." In Recent Advances in Soft Computing and Cybernetics, 149–56. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61659-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Döbbelin, Robert, Thorsten Schütt, and Alexander Reinefeld. "Building Large Compressed PDBs for the Sliding Tile Puzzle." In Communications in Computer and Information Science, 16–27. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05428-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sasaki, Shun, Hiroki Takagi, Saburo Yokokura, and Meeko Kuwahara. "A Proposal of Rehabilitation Application System Using Sliding Block Puzzles for Prevention of Mild Cognitive Impairment (MCI)." In Communications in Computer and Information Science, 98–106. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-50732-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

"Variations on Sliding Block Puzzles." In Geometric Puzzle Design, 41–44. A K Peters/CRC Press, 2006. http://dx.doi.org/10.1201/b10591-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

"Sliding-Coin Puzzles." In Tribute to a Mathemagician, 105–14. A K Peters/CRC Press, 2004. http://dx.doi.org/10.1201/9781439864791-23.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Sliding Puzzle"

1

Swan, Jerry. "Harmonic analysis and resynthesis of Sliding-Tile Puzzle heuristics." In 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2017. http://dx.doi.org/10.1109/cec.2017.7969355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Chang, Shunqi Huang, Mohd Nor Akmal Khalid, and Hiroyuki Iida. "Attractiveness of Single-Agent Game: Case Study Using Sliding Puzzle." In 2020 International Conference on Advanced Information Technologies (ICAIT). IEEE, 2020. http://dx.doi.org/10.1109/icait51105.2020.9261794.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Sliding Puzzle' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography