mobile hidden object game docoment part 1

8/10/2019 mobile hidden object game docoment part 1

1/15

< Mobile Hidden Object Game >Software Requirements Specification

Version 1.

Group !d"


2/15

Revision HistoryDate

(dd/mm/yyyy)

Version Description Author

25/06/2014 1.0 Its a small mobile game to find out

hidden things in different pictures with

different limitation like time or pointlimits.

M'1$#$&)

M'1$#$*&$


3/15

Table of Contents

1. Scope (of the project)

2. Functional Requirements Non Functional requirements

3. Use Case Diaram

!. Usae Scenarios

". #$opte$ %etho$olo&

'. or *lan (Use %S *roject to create Sche$ule+or *lan)

SRS Document

Scope of *roject,

-n this ame a pla&er is require$ to fin$ /arious items (o0jects) that are place$ on a

simple picture ith a lot of o0jects. he require$ o0jects are em0e$$e$ in the picture in

such a a& that the& are not /isi0le easil&. his is achie/e$ 0& either miin foreroun$

an$ 0acroun$ color com0inations 4R o0ject patterns. he pla&er is require$ to touch an

o0ject hich is one of the o0jects require$ at a particular le/el (stae). hen the pla&er


4/15

touches a correct o0ject it is remo/e$ from the picture or it is mare$. he ame procee$s

ith increase$ $ifficult& at each stae.

his is a sinle pla&er ame an$ in this ame e ha/e at least 15 staes an$ each stae

shoul$ offer more $ifficult&. first 3 staes $ifficult& 0ase on points for eample if pla&er

touch ron o0ject " points are minus an$ hen correct o0ject fin$ out then 15 points a$$

to the total points. if total point is rater then limit points then o to the net stae after 3staes timer ill 0e start. -n start of each stae the ame ill $ispla& a list of 15 o0jects to

fin$.

he ame application shoul$ actuall& ha/e 25 to60e6require$ require$ o0jects at each

stae 0ut the pla&er is require$ to fin$ 15 o0jects. So the ame ill set the require$ 15

o0jects ran$oml& e/er& time a stae is starte$.

-t shoul$ 0e a time 0ase$ ame. 7ach stae shoul$ ha/e a fie$ time to complete or the

time can 0e set accor$in to $ifficult& le/el i.e. time limit $ecreases a fe secon$s on each

net le/el. -f the pla&er is a0le to fin$ all 15 o0jects ithin the specifie$ time the ame

ill mo/e to net stae 4therise the ame en$s.

he application shoul$ 0e a0le to sa/e ame state hen pla&er opts to sa/e the ame. he

net time ame is launche$ it ill sho options to *la& Ne 8ame or Continue 9ast

8ame. 4n choosin continue option pla&er shoul$ 0e a0le to resume the ame from last

sa/e$ state.

Functional an$ non Functional Requirements,

unctional Re!uirements"

4nl& one pla&er can pla& this ame 0ecause it:s a sinle pla&er ame

he ame must 0e contain at least 15 staes.

hen the staes one up then $ifficult& ill 0e hih.

hen the ame start ame shoin 15 o0jects for fin$in out.

7/er& stae ha/e $ifferent hi$$en o0jects.


5/15

hen o0ject list is shon its can 0e onl& name of o0ject or picture or o0ject.

he ame ha/e 25 o0jects 0ut pla&er can fin$ onl& 15 o0jects.

8ame set ran$oml& 15 $ifferent o0ject automaticall&.

hen the pla&er fin$ correct o0ject then fin$in o0ject is 0ol$ in list or remo/e

from the list.

-t shoul$ time 0ase$ ame.

7ach stae shoul$ 0e complete$ in time. #n$ time $ifficult& ill 0e increasin

accor$in to staes.

hen the staes one up then time limit ill 0e $eceasin.

hen the pla&er fin$ out o0ject in time then ame mo/e to net stae.

e ha/e option to sa/e the ame an$ pause the ame.

#on unctional Re!uirements"

$.;int option, the application ill in$icate one of o0jects that are still not pice$ up 0& the

pla&er.

%.hen a pla&er touches a require$ o0ject it shoul$ 0e remo/e$ from require$ list (or it

shoul$ 0e mare$). -t shoul$ also 0e remo/e$ or mare$ from the picture.

Use Case Diaram(s),

USE CASE DIAGRAM1:


6/15

&S' CAS' DARA* %"


7/15

&S' CAS' +"


8/15

&sa,e Scenarios,

&se case $"


9/15

1. pla&er first open the ame.

2. S&stem sho 2 options (Start ne ame+loa$ ame).

3. *la&er choose start ne ame.

!. S&stem sho on first stae fin$in hi$$en o0jects on screen.

". No pla&er fin$in the o0ject.

'. S&stem run the timer.


10/15

Use Case -$ 1

#ction hen the ame is start pla&er shos stae one hi$$en o0jects an$

then pla&er fin$ out hi$$en o0jects in limite$ tries. -f the& can fin$

out all o0ject then o to the net stae other ise pla& aain first

stae.

Description his use case tells ho to s&stem or hen ame in startin

position.

9e/el ;ih

#ctor 9ist actors(*la&er an$ S&stem)

#lternati/e *aths *la&er can pla& alrea$& sa/e$ ame.

*re? Con$itions *la&er must 0e choose start option for pla&in

*ost ?Con$itions *la&er pla& the ame or lea/e the ame hen ame is starte$

#uthor 8ame maer

7ceptions S&stem faile$ $ata 0ase crushe$ ame not 0e proper sa/e$

Use Case title a%e &ame pla#ing state

Use Case -$ 2

#ction -n this scenario pla&er hen loa$ the sa/e$ ame then current

stae here the ame is sa/e$ this stae hi$$en o0ject ill 0e

shon to the pla&er then pla&er pla& the current stae as perame rule. hen the stae is complete$ then o to net stae

other ise pla& aain current stae

Description hen the pla&er choose to loa$ sa/e$ ame then our s&stem o

to the there point here e sa/e$ the ame an$ sho aain

o0jects an$ then all processes run normall&

9e/el ;ih

#ctor 9ist #ctors(*la&er an$ S&stem)

#lternati/e *aths Start the ame aain from the 0einnin

*re? Con$itions hen the ame is run the pla&er must 0e choose loa$ option to

pla& the ame here pla&er lea/e the ame

*ost ?Con$itions *la& the loa$e$ ame

#uthor 8ame maer

7ceptions %a& 0e sa/e$ ame $oes not loa$e$ aain. S&stem as

crushe$ for an& reason


11/15

Use Case title Stage changing use case

Use Case -$ 3

#ction hen the current stae is complete$ then o to the net staean$ net staes hi$$en o0ject shon if stae can not 0e

complete$ then pla&er aain pla& the uncomplete$ stae.

hen ne stae is start pla&er can sa/e ame an& here in

current stae an$

Description hen the pla&er complete one stae ame automaticall& sho

the net stae. #n$ net stae hi$$en o0ject sho for fin$in

out. -f pla&er $oes not complete the current stae then pla&er has

option the& can restart the stae aain.

9e/el ;ih

#ctor 9ist #ctors(*la&er an$ S&stem)

#lternati/e *aths -f the& can not complete the le/el then *la&er ha/e option to

restart the le/el of the ame or the& can restart hole ame.

*re? Con$itions *la&in staes efficientl& an$ o net staes.

*ost ?Con$itions *la&er can sa/e$ the ame or restart the ame.


12/15

#uthor 8ame maer.

7ceptions S&stem crushe$ ame not sa/e$ or an& reason.

Adopted *ethodolo,y,

e use$ @U process mo$el it:s a com0ination of aterfall an$ spiral mo$el. -n aterfall mo$el its simplean$ eas& metho$ to chec or s&stem flo ho to our plan or $esin or. -n aterfall mo$el e can not

use 0ac tracin so that:s h& it:s fast.

e use$ spiral mo$el to chec out ris ratio 0ecause client requirement an$ i$eas ith the passae of

time ill 0e chane$ so in spiral mo$el e in/ol/in client aain an$ aain hen client satisf& thenimplement the s&stem ris chance ill 0e $ecrease 0ecause the in/ol/in of client.

Waterfall Model:


13/15


14/15

Spiral Model,

Detail $esin co$in testin $eplo& an$ %aintenance

Client Satisfaction+client Requirements Chanes 7nineerin

or *lan (Use %S *roject to create Sche$ule+or *lan)


15/15

antt chart"

mobile hidden object game docoment part 1

Documents