a Norwegian computer scientist and professor at University of Bergen. His research interests include software engineering methodology, artificial intelligence, and the use of information technology to support education in software engineering and artificial intelligence. In 1993, along with Andreas L. Opdahl, he contributed to computer chess at the Advances in Computer Chess 7 conference on the topic of Long-Term Planning.
Long-Term Planning in Computer Chess
A Framework for long-term planning in computer chess is sketched and as an example the King's Indian Defence is proposed schematically. Chess plans are represented as logical initiation, fulfilment and abandonment conditions and as modifications to the parameters used to evaluate nodes in a minimax search. Several such plans are than combined to form a directed acyclic graph (DAG) through which the program moves as the game progresses. Rules are represented to support creation, maintenence and consistency of the resulting plan DAGs. Funally, further work is suggested.
- Bjørnar Tessem (1990). Interval Representation of Uncertainty in Artificial Intelligence. Ph.D. thesis, University of Bergen
- Bjørnar Tessem (1992). Interval probability propagation. International Journal of Approximate Reasoning, Vol. 7, Nos. 3-4
- Andreas L. Opdahl, Bjørnar Tessem (1994). Long-Term Planning in Computer Chess. Advances in Computer Chess 7
- Bjørnar Tessem (1997). Genetic Algorithms for Analogical Mapping. IEEE International Conference on Evolutionary Computation
- Andreas L. Opdahl, Bjørnar Tessem (2019). Towards Ontological Support for Journalistic Angles. BPMDS/EMMSAD@CAiSE 2019