Volunteer Computing Games

1. Volunteer Computing Games [ using casual games to implement a distributed algorithm ] . Maria Riolo (Cal Tech). . Evan Peck (Gordon College). . Dr. Charles Cusack (Hope College).

2. Talk structure Overview The Problem Volunteer Algorithm Casual Games The Game How it Contributes

3. Talk structure Overview The Problem Volunteer Algorithm Casual Games The Game How it Contributes Goal Definitions

4. The goal To harness the accessibility, entertainment, and growing popularity of online games and refocus it back towards the scientific community.

5. { boinc  40 projects 400,000 computers over 400 teraFLOPS seti@home einstein@home folding@home Berkeley Open Infrastructure for Network Computing Volunteer Computing {A form of distributed computing which seeks to harness the computational power of individuals from around the world }

6. Casual games { Games that are easy to learn, utilize simple controls, and aspire forgiving gameplay } Diner dash bejeweled

7. Volunteer Computing Games {A casual game where, by playing the game, people participate in volunteer computing }

8. Talk structure Overview The Problem  Volunteer Algorithm  Casual Games  The Game  How it Contributes Max Clique Max Clique to Search Tree Search Tree To Button Game Splitting Nodes Button Game Demo

9. Maximum Clique Problem Vertices 0 Maximum Clique is the clique (complete graph) of maximum size in a graph 5 1 4 2 3 Edge

10. [ 0, 1 | 3, 4 ] [ 0, 1, 2, 3, 4, 5 ] [ 0 | 1, 3, 4 ] [ 1 | 2, 3, 4 , 5 ] [ 2 | 3, 4 , 5 ] [ 3 | 5 ] [ 4 ] [ 5 ] [ 0, 1 | 3, 4 ] [ 0, 3 ] [ 0, 4 ] [ 1, 2, 3, 4 , 5 ] [ 1, 3 | 5 ] [ 1, 4 ] [ 1, 5 ] [ 2, 3 | 5 ] [ 2, 4 ] [ 2, 5 ] [ 3, 5 ] [ 1, 2, 3 | 5] [ 1, 2, 4 ] [ 1, 2, 5 ] [ 1, 3, 5 ] [ 2, 3, 5 ] 0 [ 0, 1, 3 ] [ 0, 1, 4 ] 5 1 [ 1, 2, 3, 5] 4 2 3 Search tree representation

11. splitting

12. splitting

13. No choices left Search tree to button game

14. Button game demonstration DEMO VIDEO GOES HERE

15. Talk structure Overview The Problem  Volunteer Algorithm  Casual Games  The Game  How it Contributes Client-Server Model Implementation Model Database Communication Database Design Java Communication Java Inheritance Problems with VC Statistics

16. Request list of problems Return problem list client Client-server model server game Select a problem Returns Node Solve node, return solution

17. Database communication Client (java) (mysql) database Requesting Java class Comm.java execute.php mysql.php Server (php)

18. Database Design

19. Java class communication

20. PlayableGameGenericProblem

21. Different games can applied to the same problem :: PlayableGame.java Different problems can be applied to the same game :: MaxCliqueProblem.java Level 3 12567 Zombie speed: 20 Zombie attack: 44 pause Adaptability Zombie attack

22. Problems with VC Lack of awareness Lack of broad appeal  Limited demographic  Lack of technical savvy

23. Gender of BOINC Users 93.9% 6.1% females males Boinc statistics Computer proficiency 56.6% 40.2% 3.2% beginner advanced intermed.

24. Talk structure Overview The Problem  Volunteer Algorithm  Casual Games  The Game  How it Contributes Definition Design Considerations Addressing VC Problems Statistics Additional Goals

25. Casual games { Games that are easy to learn, utilize simple controls, and aspire forgiving gameplay }

26. Design ConsiderationsFrom igda Simple and Meaningful Play  Depth and Complexity Rewarding Players  Showing Progress  Forgiving Game Play  Using Sound and Interactive Audio

27. Addressing VC Problems Lack of awareness Lack of broad appeal Lack of technical savvy Limited demographic macrovision AOL Games Yahoo! Games AddictingGames Miniclip Candystand “utilize simple controls”

28. Gender of BOINC Users Gender of all online gamers 93.9% 58% 42% 6.1% females males females males VC/ Online gaming statistics

29. our Design Goals Wide appeal gender inclusiveness wideage range range of technical abilities aesthetic integrity Easily accessible  Incorporate distributed human computing

30. Talk structure Overview The Problem  Volunteer Algorithm  Casual Games  The Game  How it Contributes Wildfire Wally Demonstration Game Design Features

31. Wildfire Wally

32. Level 3 12567 Wind: 10 mph  Humidity: 23% pause Wildfire Wally

33. Game Demonstration DEMO VIDEO GOES HERE

34. Game Design Features Simplicity  to run  to learn  to play Rapid Gameplay Showing Progress Replayability  variables  random element  extendible

35. Random element

36. Game Design Features Simplicity  to run  to learn  to play Rapid Gameplay Showing Progress Replayability  variables  random element  extendible

37. Why have a human element? If Run In Backgroundsolves the problem hundreds or thousands time faster than clicking, why even include the human element? • Still Contributes • Adds meaningful play • Stepping stone for future

38. Talk structure Overview The Problem Volunteer Algorithm Casual Games The Game How it Contributes Evolution of Problems Future Work Future Impact

39. Level 3 12567 Wind: 10 mph  Humidity: 23% pause

40. Future Work Volunteer Algorithm vs. Algorithm in C  overhead from problem > search tree  overhead from communication Volunteer Algorithm with Lots of Participants  how many to match algorithm in C?  bottleneck at database? Explore Adaptability  create new games  try new problems

41. Future impact Human Insight Massively multiplayer online gaming

42. Acknowledgments NSF Hope College Dr. Cusack Gordon College CS Department Cal Tech Math Department Zombies

43. ? ? ?Questions? ? ?