Bibliography Adelson-Velskiy, G., Arlazarov, V., & Donskoy, M. (2003). Some methods of controlling the search tree in chess programs. Artificial Intelligence, 6(4), 361­371. Aggarwal, S., Alonso, R., & Courcoubetis, C. (1988). Distributed reachability analysis for protocol verification environments. In Discrete Event Systems: Models and Application, Vol. 103 of Lecture Notes in Control and Information Sciences (pp. 40­56). Aggarwal, A., & Vitter, J. S. (1987). Complexity of sorting and related problems. In ICALP no. (pp. 467­478). Aggarwal, A., & Vitter, J. S. (1988). The input/output complexity of sorting and related problems. Journal of the ACM, 31(9), 1116­1127. Agre, P., & Chapman, D. (1987). Pengi: An implementation of a theory of activity. In AAAI, (pp. 268­272). Aho, A. V., & Corasick, M. J. (1975). Efficient string matching: An aid to bibliographic search. Communications of the ACM, 18(6), 333­340. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1989). Networks flows. In Handbooks in Operation Research and Management Science. North-Holland. Ajwani, D., Malinger, I., Meyer, U., & Toledo, S. (2008). Graph search on flash memory. MPI-TR. Akers, S. B. (1978). Binary decision diagrams. IEEE Transactions on Computers, 27(6), 509­516. Albers, S., & Henzinger, M. (2000). Exploring unknown environments. SIAM Journal on Computing, 29(4), 1164­ 1188. Alc´ zar, V., Borrajo, D., & Linares L´ pez, C. (2010). Using backwards generated goals for heuristic planning. In a o ICAPS (pp. 2­9). Allen, J. D. (2010). The Complete Book of Connect 4: History, Strategy, Puzzles. Sterling Publishing. Allis, L. V. (1998). A knowledge-based approach to connect-four. The game is solved: White wins. Master's thesis,