English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62572/95237 (66%)
Visitors : 2543858      Online Users : 179
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/109453

    Title: The Design and Implementation of Multi-Maze
    Authors: Liaw, Heh-Tyan;Jou, Chichang;Liou, Ay-Hwa Andy;Debnath, Narayan C.
    Keywords: Maze;multi-user;multi-view;network communication
    Date: 2017-01-19
    Issue Date: 2017-02-18 02:10:46 (UTC+8)
    Publisher: IOS Press
    Abstract: Maze puzzle usually has only one user. This research has adopted network technology to develop a maze game, called Multi-Maze, which allows multiple players competing across the network concurrently. It contains three sub-systems. The Maze Editor is capable of building 3, 4, or 6 degrees multi-component maze and supporting automatic, semi-automatic, or manual construction of the maze. The contour of the maze can be configured freely and the process of building a maze is recorded for replaying. The Maze Runner supports single-user or multi-user mode. In multi-user mode, teammates communicate with multi-view display and real-time chats. Foot prints, marks, flags are used for avoiding repeated movements. The maze can be shown as wall or channel map. The Maze Manager allows editing, upload, download, and grouping of the teams. Before coding the Multi-Maze, two important utility tools have been developed: Multi-view Graph Library and Network Communication Module. Formulas for calculating the coordination for different degrees has been presented. Algorithms of spanning tree have been used for building a perfect maze. The adding and deleting of walls allow the maze to be separated into components and forming circuits. The state diagrams, data structures and class hierarchies are presented for related application projects.
    Relation: Journal of Computational Methods in Science and Engineering 17(S1), p. S135-S145
    DOI: 10.3233/JCM-160686
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File Description SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback