If someone influenced by the Gray Wastes leaves do they return to normal?

When a person remains in the Gray Waste for too long all their colors get drained away and so do their hopes and dreams. They end up having no desire to leave the plane. There are plenty of ways they may end up leaving not of their own volition though. For example, a loved one could find them and drag them back home and since they don’t care about anything I don’t see them resisting, or they could get kidnapped by a fiend, or they may just have wandered off onto a rocky outcropping and failed a Dex check so they ended up falling into a portal to another plane.

My question is, If somebody ends up outside of the Gray Wastes after they have already passed the point where they’ve lost everything but have yet to become a larva or shade will they return to normal?

Will their colors return? Will their hopes and dreams return? If so how long does it take?

2nd Edition RAW answers only.

Adjacent Gray code

Gray code is permutation of $ \{0,1,2,\dots,2^n-1\}$ such that each of consecutive number is differs only one bit in binary representation.

Example for $ n = 3$

$ 000\ 001\ 011\ 010\ 110\ 111\ 101\ 100$

Let $ s_k$ is bit position of transition $ k$ to $ k+1$ . In example for $ n=3$ above are $ s_1=3,s_2=2,s_3=3,s_4=1$ and so on

I define adjacent gray code is each consecutive number is differs in adjacent bit. It is, if $ s_k=j$ than $ s_{k+1}$ is $ j-1$ or $ j+1$

Example for $ n=4$

$ 0000\ 0001\ 0011\ 0111\ 0101\ 0100\ 0110\ 0010\ 1010\ 1110\ 1100\ 1101\ 1111\ 1011\ 1001\ 1000$

Can anyone design a good algorithm to look for adjacent gray code for $ n$ large enough? Maybe it’s acceptable for $ n\leq10$

Gray code in Matrix

Suppose I have a matrix $ m \times n$ with entry 0 or 1. Of course there is a possible $ 2^{m\times n}$ matrix. I want to sort all the matrices so that every two consecutive matrices are only 1 bit different, and the different ones must be neighboring. I can make the first 2 matrices arbitrarily, but the next matrix will depend on the previous matrix. For example 2 initial matrix is

$ \begin{pmatrix} 0 & 0 \ 0 & 0 \end{pmatrix}$ and $ \begin{pmatrix} 0 & 0 \ 0 & 1 \end{pmatrix}$

The changed bit is $ a_{22}$ from 0 to 1. The third possible matrix is

$ \begin{pmatrix} 0 & 1 \ 0 & 1 \end{pmatrix}$ or $ \begin{pmatrix} 0 & 0 \ 1 & 1 \end{pmatrix}$

Because neighbors $ a_{22}$ are $ a_{12}$ and $ a_{21}$ . Can not change $ a_{11}$ because it is not neighboring $ a_{22}$

I can use dynamic programming, but complexity problems will arise if $ m, n$ is large enough. Is there maybe a better algorithm? Or special case?

This is one of examples output for $ m = n = 2$

$ \begin{pmatrix} 0 & 0 \ 0 & 0 \end{pmatrix}$

$ \begin{pmatrix} 0 & 0 \ 0 & 1 \end{pmatrix}$

$ \begin{pmatrix} 0 & 1 \ 0 & 1 \end{pmatrix}$

$ \begin{pmatrix} 1 & 1 \ 0 & 1 \end{pmatrix}$

$ \begin{pmatrix} 1 & 1 \ 1 & 1 \end{pmatrix}$

$ \begin{pmatrix} 1 & 1 \ 1 & 0 \end{pmatrix}$

$ \begin{pmatrix} 1 & 0 \ 1 & 0 \end{pmatrix}$

$ \begin{pmatrix} 0 & 0 \ 1 & 0 \end{pmatrix}$

$ \begin{pmatrix} 0 & 1 \ 1 & 0 \end{pmatrix}$

$ \begin{pmatrix} 0 & 1 \ 1 & 1 \end{pmatrix}$

$ \begin{pmatrix} 0 & 0 \ 1 & 1 \end{pmatrix}$

$ \begin{pmatrix} 1 & 0 \ 1 & 1 \end{pmatrix}$

$ \begin{pmatrix} 1 & 0 \ 0 & 1 \end{pmatrix}$

$ \begin{pmatrix} 1 & 0 \ 0 & 0 \end{pmatrix}$

$ \begin{pmatrix} 1 & 1 \ 0 & 0 \end{pmatrix}$

$ \begin{pmatrix} 0 & 1 \ 0 & 0 \end{pmatrix}$

Looking for research regarding pure black vs dark gray for readability

I’ve heard people say that websites with pure black text on a white background can cause exhaustion when reading, and that it’s better to use a very dark gray text or a light gray background color to decrease the harshness of the contrast.

Does anyone know of any research that was done to support this?

I’m scouring the internet, but not finding anything that was done recently even though you can look at many prominent content sites and see plenty of examples of this in practice.