AISpace2

• Add a visualization options toolbar that enables users to change font size, the level of detail displayed in node text, etc...
• Add ability to run notebooks that directly import from code files in a subdirectory

• UI improvements and bug fixes to widgets

This is the final release for the summer! It contains a few architectural changes and bug fixes to make your experience better.

• Support for ipywidgets 7.0.0
• Add line_width setting to search visualizations
• Add "pause" button, which will cause execution to stop when it reaches the next display call
• Add experimental analytics tracking
• Misc. bug fixes and performance improvements

• Graph builders now support resizing as the window size changes. They maintain their relative positions in the graph, instead of being layout again.
• After running a function, stepping again will report the return value of the function, if any.
• Added new help text when users attempt to step without running a function previously. Previously, it threw an error.
• For CSPs, you can now click on a node to choose which variable to split on. There is also experimental support for choosing the new domain for the split after selecting the variable.
• For CSPs, new logic has been added so that you can no longer click an arc to step through the visualization if it isn't expecting you to (i.e. arc consistency is finished)
• A minimum sleep time has been enforced across all widgets to prevent freezing of the UI if the time is set too low (or 0).

• Graph builders now support resizing as the window size changes. They maintain their relative positions in the graph, instead of being layout again.
• After running a function, stepping again will report the return value of the function, if any.
• Added new help text when users attempt to step without running a function previously. Previously, it threw an error.
• For CSPs, you can now click on a node to choose which variable to split on. There is also experimental support for choosing the new domain for the split after selecting the variable.
• For CSPs, new logic has been added so that you can no longer click an arc to step through the visualization if it isn't expecting you to (i.e. arc consistency is finished)
• A minimum sleep time has been enforced across all widgets to prevent freezing of the UI if the time is set too low (or 0).

• Directed arcs now show names, if applicable. This is especially helpful in planning problems, where the arcs now show the action that would be taken by following the edge
• Backend improvements leading to better performance on large graphs, especially for CSPs
• Support for Stochastic Local Search (SLS) solvers
• An animation option enabled on visualizers that animate positional changes of nodes and edges. This helps users follow changes to graph layouts, especially for dynamic search graphs

• Graphs now fit to the width of the window, rather than being a fixed size. The search and CSP viewers (not builders) also dynamically relayout when the window is resized
• There are now show_edge_costs and show_node_heuristics options for search visualization
• Search nodes now auto-resize and truncate text, based on their contents
• Implicit search graphs (those defined on the fly, not upfront) are now supported. When a neighbouring node is discovered, the graph now adds the new nodes and edges. Dynamically generated heuristics are also supported
• Search graphs can now be layout in a tree, useful for some search space representations. Set layout_method = "tree" to enable this behaviour
• New notebooks have been added: forward planning, regression planning, planning as CSP and domain splitting with search
• The extension is now dramatically smaller, owing to an improved build process that removes unused code and minifies the rest

This release brings in an entirely new front-end architecture. The CSP graph builder has been improved with the ability to create variable nodes, constraint nodes, and edges. Significant progress has been made in visualizing Search algorithms - you can run through A* (with Multiple Path Pruning) and Branch & Bound.

This is the first release, intended to demonstrate the installation process and the beginnings of visualizing Constraint Satisfaction Problems (CSPs).