You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The hole purpose of the hashlife algorithm is a concept called "superspeed". It is the idea that the state of a node is not computed one generation into the future but instead multiple generations far into the future. The state of a node at level n can be computed 2^(n-2) generation steps into the future.
The result is then memoized and will be stored in the hashtable.
This has yet to be implemented.
The text was updated successfully, but these errors were encountered:
The hole purpose of the hashlife algorithm is a concept called "superspeed". It is the idea that the state of a node is not computed one generation into the future but instead multiple generations far into the future. The state of a node at level
n
can be computed2^(n-2)
generation steps into the future.The result is then memoized and will be stored in the hashtable.
This has yet to be implemented.
The text was updated successfully, but these errors were encountered: