IMPORTANCE OF TIME AND SPACE IN MANCALA

Proposal,
College of Computer and Information Science, Polytechnic University of the
Philippines,
Sta. Mesa, Manila

[Josiah V. Awa-ao]
[August, 2015]

Approved by Advisory Committee Members:

Dr. [Committee Chair], Thesis Committee Chair

Dr. [Advisor #1], Thesis Committee Advisor

Dr. [Advisor #2], Thesis Committee Advisor

Introduction
According to Merrick Furst The Biggest difference between time and space is
that you cant reuse time. Therefore we need to use our time wisely. In Mancala or also
known as pebble game, as the number of shells in one place increases, the time from
moving the pebbles from one hole to another increases (slowing) as well. Technically
speaking, a problem can be solve faster by using additional space.
1

---------------------

-----------------

Methods
In order to do make the pebble game, the algorithm that were planning to use so far
are the following:

1) Counting sort The pebble game has a numerous pebble. The two players will
attempt to collect pebbles as many as possible and in order to win the game one
player must clear his or her side of pebbles. Now, in order to determine if one of
the player has already clear his or her pebble we will use the counting sort. The
counting information that will be stored in an array will be used to determine the
position of each element.
2) Boyer-Moore In pebble game each player should not put their conquered
pebbles into the mancala of their opponent. In order to avoid putting their pebbles
into their opponent mancala the Boyer-Moore algorithm could be use. If the hand
of the player has been put in front or top of his or her opponents mancala, it will
shift position from his or her opponents mancala to the next hole by the help of
this algorithm.
3) B-tree Pebble game continuously inserting and moving pebbles from the hole to
another until all pebbles placed on the Mancala of one of the players. Im
thinking that I could represent the Mancala holes as the nodes of the B-tree. Each
pebble that have been inserted to one hole to another is the same as inserting new
element to a node and deleting the inserted element from its previous node.

Background
Space and Time Trade of is a way of introducing a mind sets of trading space for
time. Our study will focus on how we can use space and time trade off algorithms in an
application that is capable of running by the use of sorting programs within this topic.
According to the book Introduction to Design and Analysis of Algorithm by Anany
Levitin , I quote Space and time trade-offs in algorithm design are a well-known issue
for both theoreticians and practitioners of computing. Consider, as an example, the
problem of computing values of a function at many points in its domain. If it is time that
is at a premium, we can pre compute the functions values and store them in a table. This
is exactly what human computers had to do before the advent of electronic computers, in

the process burdening libraries with thick volumes of mathematical tables. Though such
tables have lost much of their appeal with the widespread use of electronic computers, the
underlying idea has proven to be quite useful in the development of several important
algorithms for other problems. In somewhat more general terms, the idea is to preprocess
the problems input, in whole or in part, and store the additional information obtained to
accelerate solving the problem afterward. The capability of Space and Time Trade Offs
will be shown in many aspects of each algorithms .Our study will focus on three sorting
techniques and the first example will be the Counting Sort.
A sorting technique based on keys between specific ranges. It works by counting the
number of objects having distinct key values also its a form of hashing. Second is A Btree, a method of placing and locating files in a database. (The meaning of the letter B has
not been explicitly defined.) The B-tree algorithm minimizes the number of times a
medium must be accessed to locate a desired record, thereby speeding up the process.
Third, the Boyer-Moore. An algorithm that considers the most efficient string-matching
algorithm in usual applications, for example, in text editors and commands
substitutions .The reason is that it woks the fastest when the alphabet is moderately sized
and the pattern is relatively long. These three will be the top priority for our field of
study.
Another basis of our research and I quote that Storage space can save calculation time.
Tables can have common functional evaluations to reduce recursive calls. Another
technique is to store preprocess calculations in an array to be used during the final
calculations, this is called input enhancement. For us to make a successful program
using Space and Time Trade Off considers the righteous process of the time and space
usage.

Reference of Related Literature