XPSslidingpuzzle

by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - Artificial Intelligence
Introduced first in SolidGeometry 5.4, Creation date: 2024-01-08, Last change: 2025-08-18

Expert System implementing the first General Problem Solver (AI Programm)

Description

This creates simple the test data for the GPS=AI with respect to to Peter Norvig (1991) similar to XPSblocksworld
Please test also uncomplete goal conditions such as "space on 4"

See Also: XPSGPS , XPSEQS , XPSblocksworld

Example Illustration

Syntax

[ops,start,goal]=XPSslidingpuzzle

Output Parameter

`ops`:		cell list [n x 4] describing action-name, precondition, add-state, diff-state
`start`:		string array describing the start state
`goal`:		string array describing the final state

Examples


[ops,start,goal]=XPSslidingpuzzle   % Example efinitions of operators start-state and goal-state 
XPSEQS(ops,start, goal, 'debug')    % takes very very long
XPSEQS(ops,start, ["space on 6"], 'debug');
[a,b,c,d]=XPSEQS(ops,start, ["space on 6"], 'debug','first');               % 4 seconds
tic; [a,b,c,d]=XPSEQS(ops,start, ["space on 6" "A on 4"], 'first'); toc     % 90 seconds

References

- Norvig, Peter (1991): Paradigms of Artificial Intelligence Programming, Morgan Kaufmann Publisher, San Mateo, CA, USA
- Korf, R., and Schultze, P. 2005. Large-scale parallel breadth-first search. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), 13801385.

Copyright 2024-2025 Tim C. Lueth. All rights reserved. The code is the property of Tim C. Lueth and may not be redistributed or modified without explicit written permission. This software may be used free of charge for academic research and teaching purposes only. Commercial use, redistribution, modification, or reverse engineering is strictly prohibited. Access to source code is restricted and granted only under specific agreements. For licensing inquiries or commercial use, please contact: Tim C. Lueth

Last html export of this page out of FM database by TL: 2025-09-21