Can I Run Minesweeper. Check the Minesweeper system requirements. Can I Run it? Test your specs and rate your gaming PC. System requirements Lab runs millions of PC requirements tests on over 6,000 games a month.
- Audibert, J.-Y., Munos, R., Szepesvari, C.: Use of variance estimation in the multi-armed bandit problem. In: NIPS 2006 Workshop on On-line Trading of Exploration and Exploitation (2006)Google Scholar
- Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. The Journal of Machine Learning Research 3, 397–422 (2003)zbMATHMathSciNetGoogle Scholar
- Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2/3), 235–256 (2002)zbMATHCrossRefGoogle Scholar
- Becker, K.: Teaching with games: the minesweeper and asteroids experience. J. Comput. Small Coll. 17, 23–33 (2001)Google Scholar
- Ben-Ari, M.M.: Minesweeper as an NP-complete problem. SIGCSE Bull. 37, 39–40 (2005)CrossRefGoogle Scholar
- Bertsekas, D., Tsitsiklis, J.: Neuro-dynamic Programming. Athena Scientific (1996)Google Scholar
- Castillo, L.P.: Learning minesweeper with multirelational learning. In: Proc. of the 18th Int. Joint Conf. on Artificial Intelligence, pp. 533–538 (2003)Google Scholar
- Couëtoux, A., Hoock, J.-B., Sokolovska, N., Teytaud, O., Bonnard, N.: Continuous Upper Confidence Trees. In: Coello, C.A.C. (ed.) LION 5. LNCS, vol. 6683, pp. 433–445. Springer, Heidelberg (2011)CrossRefGoogle Scholar
- Couetoux, A., Milone, M., Teytaud, O.: Consistent belief state estimation, with application to mines. In: Proc. of the TAAI 2011 Conference (2011)Google Scholar
- Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: Ciancarini, P., van den Herik, H.J. (eds.) Proc. of the 5th Int. Conf. on Computers and Games, pp. 72–83 (2006)Google Scholar
- Gordon, M., Gordon, G.: Quantum computer games: quantum Minesweeper. Physics Education 45(4), 372 (2010)CrossRefGoogle Scholar
- Hein, K.B., Weiss, R.: Minesweeper for sensor networks–making event detection in sensor networks dependable. In: Proc. of the 2009 Int. Conf. on Computational Science and Engineering, CSE 2009, vol. 01, pp. 388–393. IEEE Computer Society (2009)Google Scholar
- Kaye, R.: Minesweeper is NP-complete. Mathematical Intelligencer 22, 9–15 (2000)zbMATHMathSciNetCrossRefGoogle Scholar
- Kocsis, L., Szepesvári, C.: Bandit Based Monte-Carlo Planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press (1994)Google Scholar
- Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 6, 4–22 (1985)zbMATHMathSciNetCrossRefGoogle Scholar
- Lee, C.-S., Wang, M.-H., Chaslot, G., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., Hong, T.-P.: The Computational Intelligence of MoGo Revealed in Taiwan’s Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in Games (2009)Google Scholar
- Nakov, P., Wei, Z.: Minesweeper, #minesweeper (2003)Google Scholar
- Pedersen, K.: The complexity of Minesweeper and strategies for game playing. Project report, univ. Warwick (2004)Google Scholar
- ROADEF-Challenge. A large-scale energy management problem with varied constraints (2010), http://challenge.roadef.org/2010/
- Rolet, P., Sebag, M., Teytaud, O.: Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm. In: Buntine, W., Grobelnik, M., Mladenić, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part II. LNCS, vol. 5782, pp. 302–317. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- Rolet, P., Sebag, M., Teytaud, O.: Optimal robust expensive optimization is tractable. In: GECCO 2009, Montréal Canada, 8 p. ACM Press (2009)Google Scholar
- Studholme, C.: Minesweeper as a constraint satisfaction problem. Unpublished project report (2000)Google Scholar
- Sutton, R., Barto, A.G.: Reinforcement learning. MIT Press (1998)Google Scholar
- Teytaud, F., Teytaud, O.: On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms. In: IEEE Conf. on Computational Intelligence and Games, Copenhagen, Denmark (2010)Google Scholar
Quantum Cat-sweeperThis is a super simple game loosely based on Minesweeper Flags and runs on the or simulator. Rules of the game:. Don't explode the cat (bombs). The tile numbers indicate the number of times you need to click on the same colour to reveal the whole group. If a tile has an! At the end that means quantum probability was not in your favour and that tile click does not count.
To win the game, find the golden kitty (who moves based on whether you reveal a! Or normal tile)Game PageGame OverExplanationThe placement of the bombs are determined using the. A Hadamard gate is used on the qubit that represents the bomb and when the tile is clicked, the qubit is measured. It has a 50/50 chance of evaluating to a 1 (bomb explodes) or a 0 (bomb defuses).A half NOT gate is applied to each qubit representing a number tile. For example: if you reveal a purple 3 tile, you need to click two more purple 3 tiles before the whole purple section reveals. For each click there is a 50/50 chance of the qubit evaluating to a 1 or 0. If out of the 1024 shots, more of them are 1, then your click counts and you only need to find one more purple tile before the whole group reveals.
If there are more 0's, then your click does not count and you still need two more clicks of a purple tile to reveal the group.The golden cat moves around based on your click. If you find it you win 100% of the time.
If you reveal a tile with a positive (not!) or neutral evaluation (defused bombs, blank tiles) then the cat moves one space in the direction of the tile you just clicked. If a negatively evaluated tile is clicked the golden cat moves one space away. This knowledge can be used as strategy to win the game. Installation Guide.