Imagine trying to make chess and not knowing about the property limit.
3 Likes
yes with the
getting in the way it becoming harder to make chess according to ClicClac also bro 
didn’t they showed this in the tutorial or something? or on a guide?
1 Like
we also have memory that we need to worry about which means we need to make space for the mechanics and do we need coding for this and if yes hey @getrithekd does coding require memory?
1 Like
500 memory
2 Likes
500 MEMORY?! nah and here to hoping we don’t need it. we won’t even be done with the chess guide by then.
1 Like
i think i found a way to get around the property limit… instead of using a property for each piece in the game, use one property to store all the chess piece’s locations’. lemme search up scietific chess notaion rq
2 Likes
per 75 blocks, not 1
2 Likes
oh i was about to say. but then much properity would cost for memory?
1 Like
something like 10 i think?? 10 to 100
2 Likes
and if i do some calucations here. with the current memory of the chess piece and board. hold on i need to ask how much memory was used in the chess guide without the mechanics
1 Like
i got it! this is algebraic chess notation:
first letter of piece’s name + the coordinate it moves to!
ex. Be5 (bishop moves to e5)
1 Like
then we would need to include the rows first so the code would know where the piece would going in which row and column! and if it avaible or not
1 Like
im thinking 2x2 gkc tile for each chess tile, and chess board is 8x8, so 4x64 = 256 gkc tiles. 256x2 memory per gkc tile = 512 memory for the chess board, but not the pieces
1 Like
Oh yeah. I sorta know how to move props using properties + channels + teleporters, which is not that complex… Was gonna make a guide on it.
1 Like
certin pieces has their own ability of where to move tho clef and goes their own coding too!
1 Like
i play chess so you want a quick tutorial of how chess pieces move?
pawn: move 1 or 2 tiles forward on the first turn, and 1 on all other turns. can only take diagonally
queen: move as many tiles you want in all directions
king: move to all adjacent tiles (1 tile in every direction)
bishop: move as many tiles in all diagonal directions
knight: move in a L shape, only piece that can just over other pieces.
rook: move as many tiles in all directions exept diagonals.
2 Likes
How do you get to the code I have been looking for a while. I play on Chromebook if that matters.
I mean I tried researching sentry-based detection but nothing works
2 Likes
Bro read the title. It says that it doesn’t have the mechanics.
5 Likes
ok good another chess player is here!
2 Likes