Additive Features in Positional Games

Coray, Giovanni

doi:10.1007/978-94-010-1545-5_18

Search citation statements

Order By: Relevance

Paper Sections

Select...

Win P O S S I B I L I T I E S : a D D I T I V E Puzzles1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1986

1995

Publication Types

Select...

Other1

Book1

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If Before we introduce this class of puzzles, some more general s t a t e m e n t s can be made. For precise details see [9,34]. It idoes mean, however, that if a state does have the p r o p e r t y before a relevant move, it would lose it after the move.…”

Section: Win P O S S I B I L I T I E S : a D D I T I V E Puzzlesmentioning

confidence: 99%

Self-improvement in problem-solving

Banerji

1986

Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems

View full text Add to dashboard Cite

Section: Win P O S S I B I L I T I E S : a D D I T I V E Puzzlesmentioning

confidence: 99%

Self-improvement in problem-solving

Banerji

1986

Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems

View full text Add to dashboard Cite

Search Reduction Techniques in Jumping Games

Pevac¹,

Pevac²

1995

Intelligent Systems Third Golden West International Conference

View full text Add to dashboard Cite

An Algorithm for Colouring Additive Puzzles

Dabija¹

1987

Kybernetes

View full text Add to dashboard Cite

Additive puzzles form a large and important class of problems in Artificial Intelligence, since many other problems may be shown to be homomorphic to them, and many techniques for solving them are easily transferable to certain classes of problems. For many additive puzzles, a homomorphic puzzle can be sometimes obtained which is much simpler than the initial one. If the simple puzzle cannot be solved from the image of a state in the first puzzle, then the first puzzle cannot be solved from that state. A method to obtain a simple homomorphic puzzle is by colouring its board. This paper presents an algorithm for colouring the boards of additive puzzles. Three heuristic backtracking decisions are discussed and their experimental performances are compared.

show abstract

Additive Features in Positional Games

Cited by 3 publications

References 2 publications

Self-improvement in problem-solving

Self-improvement in problem-solving

Search Reduction Techniques in Jumping Games

An Algorithm for Colouring Additive Puzzles

Contact Info

Product

Resources

About