• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.01a
• /
• pp.353-354
• /
• 2019

게임에서 캐릭터가 점프 하는 중 플레이어가 스킬을 사용하면, 모든 물체가 정지 되는 기능을 구현해야 하는 상황에 놓이게 된다. Unity Engine에 내장 된 중력을 사용하면, 플레이어가 스킬을 사용 할 때 Rigid Body 속성을 사용하여 움직임을 제한할 수 있다. 그러나, 스킬 사용으로 인한 움직임정지를 해제 할 때 물체의 이전 속력이 사라져 움직임이 부자연스럽게 된다. 이를 해결하기 위해 수학 계산을 통해 시간 값에 따른 중력 값을 대입 하는 방법을 사용하면, 속력이 매우 커 타일을 통과해서 지나가는 현상이 나타난다. 본 논문에서는 다음 프레임 위치 계산을 통해 이러한 문제를 보정하는 방법과 수학 계산식을 통해 속력을 계산했을 때의 문제점 보완 방법 등에 대하여 연구하였다.

• Information Systems Review
• /
• v.10 no.3
• /
• pp.21-38
• /
• 2008

After the introduction stage, Korean mobile game market is approaching to the growing stage leading mobile contents market. The environment for the mobile contents business is getting better by the expansion of the 3G mobile networks and the enhancement of the mobile devices. In this research, at a content level, not a service level, market success factors of mobile games and the differences by genres and their changes over time were investigated through the analysis of the real market data of mobile games launched by a Korean mobile carrier. The most important factors for market success, especially for the genres of RPG/Tycoon/Simulation and Shooting/Action/Arcade, were found to be the 'design' factor and its effect turned to be getting stronger as time goes by after the launch. Consumers' purchase rate was actually higher for the mobile games of popular genres or in relation with socially popular subject matters. Also 'design' and 'creativity' factors which are related to the quality of contents, have gotten more important over time. One of the most interesting results was that there existed a "blue ocean" genres like Sports/Racing/Leisure which had a steady demand but not many competing games. In the analysis of the 'convenience' factor, one interesting implication for mobile game producers was that there exists a trade off between the ease of initial adoption and the steady sales of a mobile game.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1026-1033
• /
• 2016

Path-finding on a grid map is a problem generally addressed in the fields of robotics, intelligent agents, and computer games. As technology advances, virtual game worlds tend to be represented more accurately and more realistically, resulting in an excessive increase in the number of grid tiles and in path-search time. In this study, we propose a path-finding algorithm that allows a prompt response to real-time queries by constructing a reduced state space and by precomputing all possible paths in an offline preprocessing stage. In the preprocessing stage, we vertically decompose free space on the grid map, construct a connectivity graph where nodes are the decomposed regions, and store paths between all pairs of nodes in matrix form. In the real-time query stage, we first find the nodes containing the query points and then retrieve the corresponding stored path. The proposed method is simulated for a set of maps that has been used as a benchmark for grid-based path finding. The simulation results show that the state space and the search time decrease significantly.