http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Analysis on Behavioral Similarity of N-Puzzle with 3n+1 Problem
아흐마드 이자즈,신석주 한국차세대컴퓨팅학회 2018 한국차세대컴퓨팅학회 논문지 Vol.14 No.1
3n+1 problem is well known in mathematics as arithmetically simplest to state yet hard to prove conjecture. The difficulty in finding a proof for the conjecture lies in its isolation from other mathematical areas and the fact that no pattern can be seen in the sequence. The N-puzzle is a tile game in which a sequence of moves is performed to reach goal state from any initial configuration. In this paper we present the study of 3n+1 problem’s iterations with respect to the moves of N-puzzle. We have implemented the Modified Syracuse algorithm to find length of T-trajectory of 3n+1 problem, and A* algorithm with Manhattan distance for finding optimal number of moves in N-puzzle. We have shown that in N-puzzle the sequence of optimal moves behaves similar to the random nature of 3n+1 problem iteration based on the Hamming distance and Kendall tau distance of N-puzzle initial configuration and goal state.