introduction: the term dynamic assessment (da) refers to an assessment, by an active teaching process, of a child's perception, learning, thinking, and problem solving. the process is aimed at modifying an individual's cognitive functioning and observing subsequent changes in learning and problem-solving patterns within the testing situation. da has been advocated as an alternative an...

This thesis describes and investigates how computer vision algorithms and stereo vision algorithms may be applied to the problem of object detection. In particular, if computer vision can aid on puzzle solving. The idea to use computer application for puzzle solving came from the fact that all solution techniques are algorithms in the end. This fact leads to the conclusion that algorithms are w...

Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of...

We examine Generalized Towers of Hanoi, Generalized Spin-Out, and the Combination Puzzle, and continue to describe the puzzles and their properties. We introduce Finite State Transducers (FSTs) that compute the shortest sequence of winning moves for each of these puzzles for all dimensions, and show that the solution sequence for Spin-Out is not finite-state computable when going from configura...

This paper describes the impetus behind and design of a quasi-casual math puzzle game with the goal of crowdsourcing formal software verification through the analysis of loop invariants. This game, Xylem: The Code of Plants, presents players with puzzles derived from data produced by loops in a particular piece of software. Solving these puzzles involves finding and expressing a loop invariant ...

Abstract While many species of animals can solve food‐baited problems, most studies are conducted in captivity, which may not reflect the natural behavioural and cognitive abilities wild animals. As few have explored problem solving Australian generally, we investigated native rainforest Wet Tropics Queensland. We baited multiple types puzzles (matchbox task, cylinder tile lever tasks on a Trix...

Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the"simplest"solution. Different ways of reasoning with the constraints are formalised by various families of"resolution rules", each of them carrying its own notion of simplicity. A large part of the book ...

We consider weakly-verifiable puzzles which are challenge-response puzzles such that the responder may not be able to verify for itself whether it answered the challenge correctly. We consider k-wise direct product of such puzzles, where now the responder has to solve k puzzles chosen independently in parallel. Canetti et al have earlier shown that such direct product puzzles have a hardness wh...

We consider a large class of models where the SU(5) gauge symmetry and a Froggatt-Nielsen (FN) Abelian flavor symmetry arise from a U(5)×U(5) quiver gauge theory. An intriguing feature of these models is a relation between the gauge representation and the horizontal charge, leading to a restricted set of possible FN charges. Requiring that quark masses are hierarchical, the lepton flavor struct...

Tim Kovacs " Artificial Intelligence is ten years away. .. and always will be. " Anonymous.