Need some testcases on solving this problem
- by user285825
I am trying to solve the minesweeper problem of acm problemset archive,
http://uva,onlinejudge,org/index,php?option=com_onlinejudge&Itemid=8&category=13&page=show_problem&problem=1130
I tested with all the possible cases that I can imagine of:
1, minimum
1 1
,
1 1
#
2, maximum
upto 100
upto 100
repeat until 100
3, for each position I test for mine
4 4
,,,
,,,,
,,,,
4 4
,#,,
,,,,
,,,,
,,,,
lastly
4 4
,,,,
,,,,
,,,,
,,,#
4, for each postion I put a ',' and surround it with mines
4 4
,###
#
#
#
4 4
,
#
#
#
lastly
4 4
#
#
#
,
I thought that these are reasonable and representative sets of testcases, But still Wrong answer, I am not sure what else could I test for, I would be glad if someone throw some light on further strategy to test this thing,
