I have a site built with WordPress. Initially, because the default content of the template was indexed in Google, I decided to remove those urls through the removals section in the Google console search. I also enabled the nofollow and noindex tags for all posts and tabs via the yoast plugin. After that, when I searched site: domain.com, there was no address. When I tried to index the home page again from the Google console search, https://example.com, I came across a noindex error while I had previously removed the tags. Other pages do not provide this error, but I will encounter a URL error that will be indexed only if certain conditions are met in livetest. I don’t know why in the beginning, even though I didn’t create a sitemap, everything was normal and the pages were indexed quickly, but after I deleted the previous urls and added new ones, the pages don’t index. Of course, the last time Google crawled the home page was on May 26.

# Tag: search

## Google SEO – Sports Website – Display live scores in search results

What would it take for Google to recognise live scores of a Sports League and display in search results?

Could not find any relevant documentation. An example from here –

## How can I treat a problem like a search problem in AI?

I’m a CS student and I’m trying to understand the **searching algorithms** used in AI.

My problem is that I don’t really understand how to **treat a problem like a search problem**. I don’t know which would be the **first steps** for solving it and how shall I choose the right algorithm for that.

For example, I have a problem like that:

*n vehicles occupy squares (1, 1) through (n, 1) (i.e., the bottom row) of an n×n n grid. The vehicles must be moved to the top row but in reverse order; so the vehicle i that starts in (i, 1) must end up in (n−i+ 1, n). On each time step, every one of the n vehicles can move one square up, down, left, or right, or stay put; but if a vehicle stays put, one other adjacent vehicle (but not more than one) can hop over it. Two vehicles cannot occupy the same square.*

I understood that the start state of each car is the bottom row, each car has at most five possible moves from any position and if each car has a 3×3 grid of empty space around it, then all five moves are possible.

My idea is that I should treat the car route like a tree where each node is a position of the car at a time, but I don’t know how correct is it.

Which would be my first steps regarding this problem to solve it like a search problem?

I would be very thankful for any advice!

## multi-threaded custom search engine problem

I am trying to create custom search engine and everything seems to work fine when I test it using “Test Engine”

also when I select “Use Detailed Harvester” everything works as expected all 10 pages being scraped

but when I check “Use Custom Harvester” only one page seems being scraped every time I try and I am trying to figure out what am I doing wrong

here is my config from engines.dat

`[Engine37]`

Displayname=Seznam

QueryString=https://search.seznam.cz/?q={KEYWORD}&count=10&from={PAGENUM}

MustBeInTag=

MustNotBeInTag=

MustBeInLink=http

MustNotBeInLink=

JustBeforeLink=class="Result-title-link" href="

RightAfterLink="

PageStart=1

PageInc=10

NextPageMarker=title="Další strana"

Translation=%3f=?|%3d==|%26=&|%3a=:|&=&|%2F=/

headerData=Cookie:

Referer=0

SSLVersion=2

Favicon=/9j/4AAQSkZJRgABAQAAAQABAAD/2wBDAAMCAgMCAgMDAwMEAwMEBQgFBQQEBQoHBwYIDAoMDAsKCwsNDhIQDQ4RDgsLEBYQERMUFRUVDA8XGBYUGBIUFRT/2wBDAQMEBAUEBQkFBQkUDQsNFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBT/wAARCAAQABADASIAAhEBAxEB/8QAHwAAAQUBAQEBAQEAAAAAAAAAAAECAwQFBgcICQoL/8QAtRAAAgEDAwIEAwUFBAQAAAF9AQIDAAQRBRIhMUEGE1FhByJxFDKBkaEII0KxwRVS0fAkM2JyggkKFhcYGRolJicoKSo0NTY3ODk6Q0RFRkdISUpTVFVWV1hZWmNkZWZnaGlqc3R1dnd4eXqDhIWGh4iJipKTlJWWl5iZmqKjpKWmp6ipqrKztLW2t7i5usLDxMXGx8jJytLT1NXW19jZ2uHi4+Tl5ufo6erx8vP09fb3+Pn6/8QAHwEAAwEBAQEBAQEBAQAAAAAAAAECAwQFBgcICQoL/8QAtREAAgECBAQDBAcFBAQAAQJ3AAECAxEEBSExBhJBUQdhcRMiMoEIFEKRobHBCSMzUvAVYnLRChYkNOEl8RcYGRomJygpKjU2Nzg5OkNERUZHSElKU1RVVldYWVpjZGVmZ2hpanN0dXZ3eHl6goOEhYaHiImKkpOUlZaXmJmaoqOkpaanqKmqsrO0tba3uLm6wsPExcbHyMnK0tPU1dbX2Nna4uPk5ebn6Onq8vP09fb3+Pn6/9oADAMBAAIRAxEAPwD6G/bX+LfxT8C+J7ax0Oa68P8AhGSBNmq2UfM8pzuDS4JQjoFGCevOeOp/Y78L31pqeseIb74p2vjia/tkiksba8kuDGwbcHcy4cFdxAG0D5zXuPir4keEdNabStSuBqcz5il06zspL9yccq0cSPj/AIEK8IsvhAdf+MnhXxV4C8C33w607T7vztU1G+22gvocjMKWYYkbhkFmCYznBIFeBOk4Yr2ylz67Xen3affY/XcLmFLE5E8tqUFhvdd6nLG1S2qu5WldtWvByd3tbb//2Q==

GracePeriod=0

UserAgent=Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:56.0) Gecko/20100101 Firefox/56.0

Selected=1

DetailedSelected=1

FollowRelocation=1

AddRelative=

AddFieldValue=

ClearCookies=0

ListMode=0

ReadOnly=0

## check if a binary tree is a binary search tree

I have some doubts about this algorithm which checks if a binary tree is a binary search tree:

`isAbr(x) { if(x == NULL) return <true, -∞, +∞>; if(x.left == NULL && x.right == NULL) return <true, x.key, x.key>; <abrLeft, minLeft, maxLeft> = isAbr(x.left); <abrRight, minRight, maxRight> = isAbr(x.left); abr = abrLeft && abrRigh && (x.key > maxLeft) && (x.key < minLeft); min = MIN(minLeft, minRight, x.k); max = max(maxLeft, maxRight, x.k); return <abr, min, max> } `

in particular, it is not clear to me what happens when a node has only one child:

for example, here, the node with the value 6 returns $ <true, 6, 6>$ , and the NULL node to the right of the root returns $ <true, -∞, + ∞>$ ; but with the instruction `abr = abrLeft && abrRigh && (x.key > maxLeft) && (x.key < minLeft); `

don’t we get FALSE $ (8 < -∞)$ ?

## Why Are Search Engines So Important?

Hello Friends,

Why are search engines so important?

## Insert a node in a binary search tree

The teacher gave us this code that inserts a node in a binary search tree, but I am not sure what the $ z.p = y$ instruction does. wouldn’t the algorithm work without it?

`abr_insert(T, z) //z is the node that must be inserted { y = NULL; x = T.root; while(x != NULL) { y = x; if(z.key < x.key) x = x.left; else x = x.right; } z.p = y; //here is the instruction that I don't understand if(y = NULL) T.root = z; else if(z.key < y,key) y.left = z; else y.right = z; } `

## stolen article is the first result in google search

After moving my old domain as I have noted that my post URL disappeared from the google search as shown below

Is it normal?

The main issue when I tried to search by the keyword Show / Hide fields based on choice field selection using JQuery in SharePoint I found out the first result is a stolen article with my identical image and content

# So I am Wondering

- How the stolen article get rank 1 in the search result
- Is it normal my migrated url not appear in google as sown in the image 1
- How to overcome this issue and get my post come back to the first result, should I reminded the old post url or reindex the new one

Please Help

**update**

301 redirect implemented correctly 4 months ago

## Deletion in a Binary search Tree

The teacher explained to us this algorithm for deleting a node in a binary search tree, but I can’t understand how it works when the node to be deleted has only one child (I already know how it works theoretically).

Algorithm:

`abc_delete(T, z) // z is the node that must be eliminated { if((z.left == NULL) && (z.right == NULL)) y = z; else y = abr_successor(z); if(y.left != NULL) x = y.left; else x = y.right; if(x != NULL) x.p = y.p; if(y.p == NULL) T.root = x; else { if(y == (y.p).left) (y.p).left = x; else (y.p).right = x; } if(y != z) z.key = y.key; return y; } abr_successor(x) { if(x == NULL) return NULL; if(x.right != NULL) return abr_min(x.right) y = x.p; while(y != NULL && x = y.right) { x = y; y = y.p; } return y; } `

For example, I want to delete the node number $ 7$ :

But, shouldn’t the end result be this?

## search in code

hello everyone, I am new to the forum, I would like to ask a question: is it possible to do a search on the web for all the sites / pages that have a certain google analythics id or facebook pixel in the code? thanks