D
Domain Algebra Official Site
Memristor Fixed Point Demo

Eight queens as compiled hardware constraints.把八皇后做成一块编译后的硬件约束面板。

This page turns the eight-queens problem into an interactive $8 \times 8$ memristor crossbar where rows, columns, and diagonals suppress each other until the state reaches a fixed point.这一页把八皇后问题做成一个可交互的 $8 \times 8$ 忆阻交叉阵列,行、列与对角线会彼此抑制,直到状态收敛到不动点。

Manual placement lets you demonstrate local inhibition cell by cell. Automatic mode follows a compiled convergence path and makes the structural interpretation visible without discussing search trees.手动放置适合逐格演示局部抑制;自动模式沿着一条编译后的收敛轨迹推进,让结构解释直接可见,而不必把注意力放在搜索树上。

Figure 2 Physical Mapping物理映射

Crossbar交叉阵列

Each cell $x_{i,c}$ is a 1T1R unit. Row lines encode queens, column lines encode domain values, and diagonal conflicts are compiled into hard gating connections.每个单元 $x_{i,c}$ 对应一个 1T1R 位置。行线编码皇后,列线编码取值,对角冲突被编译成硬门控连线。

Fixed Point Propagation传播
$$X^{(t+1)} = \widetilde{T}(X^{(t)})$$

The demo updates the grid by repeated inhibition. What remains active after propagation is not a guessed answer but a stable state of the compiled system.演示通过重复抑制更新网格。传播后保留下来的激活,不是猜中的答案,而是编译后系统的稳定态。

Interpretation

The eight-queens problem is not solved by search, but by convergence to a fixed point of a compiled constraint system.八皇后问题不是靠搜索解出来的,而是靠一个已编译约束系统收敛到不动点而得到解。

Interactive Board

Touch the grid, then watch inhibition propagate.先点亮一个格子,再看抑制如何在阵列里扩散。

Green cells are active queens, red cells are physically blocked, and warm diagonal links represent the gating network for non-monotone conflict constraints.绿色表示激活的皇后,红色表示已经被物理阻断的单元,暖色对角连线表示用于非单调冲突约束的门控网络。

8 × 8 crossbar manual or auto hard diagonal gating fixed-point readout
Diagonal gating transistor network. A simultaneous pair on the same diagonal is structurally forbidden.对角线门控晶体管网络。同一对角线上的双激活在结构上被禁止。
Click any gray candidate to place a queen. Click a green queen to release that row again.点击灰色候选格即可放置皇后;再次点击绿色皇后会释放该行。 phase: idle阶段:空闲
Ready for manual placement.等待手动放置。 not converged未收敛
Queen / conductive皇后 / 导通 Blocked / high resistance禁止 / 高阻 Candidate / undecided候选 / 未定 Gate / $\tau$ non-monotone门控 / $\tau$ 非单调
Compilation Path

From symbolic CSP to a visible board update.从符号约束系统到可见的棋盘更新。

The cards below compress the full explanation into a short visual pipeline.下面这组卡片把完整解释压缩成一个短的视觉流程。

(a) Symbolic CSP

One queen per row每行一个皇后

$Q_i \in \{1,\dots,8\}$ with column and diagonal exclusion. The symbolic view names admissible placements before any hardware mapping.$Q_i \in \{1,\dots,8\}$,再加列约束和对角约束。符号层先描述哪些放置是可容许的。

(b)(c) Encoding + Crossbar

Binary fiber $x_{i,c}$二值纤维 $x_{i,c}$

Each board cell becomes a physical unit. The row index fixes the queen identity; the column index fixes the domain value.棋盘上的每个格子对应一个物理单元。行索引固定皇后身份,列索引固定取值。

(d)(e)(f) Constraints + Readout

Inhibit until stable持续抑制直到稳定

WTA enforces row uniqueness, lateral inhibition enforces column exclusion, and gated diagonals enforce the non-monotone part. The final green pattern is the readout.WTA 负责行唯一性,横向抑制负责列排斥,门控对角线负责非单调部分。最后留下的绿色图样就是读出结果。

Result

A stable readout, not a backtracking trace.读出来的是稳定态,不是回溯轨迹。

The demo converges to the same canonical solution every time so that the physical readout remains clear and stable in presentation.这个演示每次都会收敛到同一组规范解,使物理读出的展示保持清晰稳定。

Method方法 Reading解释
Backtracking回溯 Tree exploration over possibilities.在可能性树上展开探索。
Compiled array编译阵列 Parallel elimination toward a fixed point.并行消除并收敛到不动点。